Matches in ScholarlyData for { ?s ?p ?o. }
- item-3 hasContent ping-luo.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent min-wang.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent conglei-yao.
- item-5 previous item-4.
- readalong-reading-articles-and-comments-together creator chiranjib-bhattacharyya.
- readalong-reading-articles-and-comments-together creator dyut-kumar-sil.
- readalong-reading-articles-and-comments-together creator srinivasan-h-sengamedu.
- readalong-reading-articles-and-comments-together type InProceedings.
- readalong-reading-articles-and-comments-together label "ReadAlong: Reading Articles and Comments Together".
- readalong-reading-articles-and-comments-together sameAs readalong-reading-articles-and-comments-together.
- readalong-reading-articles-and-comments-together abstract "We propose a new paradigm for displaying comments: showing comments alongside parts of the article they correspond to. We evaluate the effectiveness of various approaches for this task and show that a combination of bag of words and topic models performs the best.".
- readalong-reading-articles-and-comments-together hasAuthorList authorList.
- readalong-reading-articles-and-comments-together hasTopic World_Wide_Web.
- readalong-reading-articles-and-comments-together isPartOf proceedings.
- readalong-reading-articles-and-comments-together title "ReadAlong: Reading Articles and Comments Together".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent dyut-kumar-sil.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent srinivasan-h-sengamedu.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent chiranjib-bhattacharyya.
- item-3 previous item-2.
- recommendations-for-the-long-tail-by-term-query-gr creator fabrizio-silvestri.
- recommendations-for-the-long-tail-by-term-query-gr creator francesco-bonchi.
- recommendations-for-the-long-tail-by-term-query-gr creator hossein-vahabi.
- recommendations-for-the-long-tail-by-term-query-gr creator raffaele-perego.
- recommendations-for-the-long-tail-by-term-query-gr creator rossano-venturini.
- recommendations-for-the-long-tail-by-term-query-gr type InProceedings.
- recommendations-for-the-long-tail-by-term-query-gr label "Recommendations for the Long Tail by Term-Query Graph".
- recommendations-for-the-long-tail-by-term-query-gr sameAs recommendations-for-the-long-tail-by-term-query-gr.
- recommendations-for-the-long-tail-by-term-query-gr abstract "We define a new approach to the query recommendation problem. In particular, our main goal is to design a model enabling the generation of query suggestions also for rare and previously unseen queries. In other words we are targeting queries in the long tail. The model is based on a graph having two sets of nodes: Term nodes, and Query nodes. The graph induces a Markov chain on which a generic random walker starts from a subset of Term nodes, moves along Query nodes, and restarts (with a given probability) only from the same initial subset of Term nodes. Computing the stationary distribution of such a Markov chain is equivalent to extracting the so-called Center-piece Subgraph from the graph associated with the Markov chain itself. Given a query, we extract its terms and we set the restart subset to this term set. Therefore, we do not require a query to have been previously observed for the recommending model to be able to generate suggestions.".
- recommendations-for-the-long-tail-by-term-query-gr hasAuthorList authorList.
- recommendations-for-the-long-tail-by-term-query-gr hasTopic World_Wide_Web.
- recommendations-for-the-long-tail-by-term-query-gr isPartOf proceedings.
- recommendations-for-the-long-tail-by-term-query-gr title "Recommendations for the Long Tail by Term-Query Graph".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent francesco-bonchi.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent raffaele-perego.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent fabrizio-silvestri.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent hossein-vahabi.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent rossano-venturini.
- item-5 previous item-4.
- rolling-boles-optimal-xml-structure-integrity-for- creator marcel-waldvogel.
- rolling-boles-optimal-xml-structure-integrity-for- creator sebastian-belle.
- rolling-boles-optimal-xml-structure-integrity-for- creator sebastian-graf.
- rolling-boles-optimal-xml-structure-integrity-for- type InProceedings.
- rolling-boles-optimal-xml-structure-integrity-for- label "Rolling Boles, Optimal XML Structure Integrity for Updating Operations".
- rolling-boles-optimal-xml-structure-integrity-for- sameAs rolling-boles-optimal-xml-structure-integrity-for-.
- rolling-boles-optimal-xml-structure-integrity-for- abstract "While multiple techniques exist to utilize the tree structure of the Extensible Markup Language(XML) regarding integrity checks, they all rely on adaptions of the Merkle Tree: All children are acting as one slice regarding the check-sum of one node with the help of an one-way hash concatenation. This results in postorder traversals regarding the (re-)computation of the integrity structure within modification operations. With our approach we perform nearly in-time updates of the entire integrity structure. We therefore equipped an XHash-based approach with an incremental hash function. This replaces postorder traversals by adapting only the incremental modifications to the check-sums of a node and its ancestors. With experimental results we prove that our approach only generates a constant overhead depending on the depth of the tree while native DOMHash implementations produce an overhead based on the depth and the number of all nodes in the tree. Consequently, our approach called Rolling Boles generates sustainable impact since it facilitates instant integrity updates in constant time.".
- rolling-boles-optimal-xml-structure-integrity-for- hasAuthorList authorList.
- rolling-boles-optimal-xml-structure-integrity-for- hasTopic World_Wide_Web.
- rolling-boles-optimal-xml-structure-integrity-for- isPartOf proceedings.
- rolling-boles-optimal-xml-structure-integrity-for- title "Rolling Boles, Optimal XML Structure Integrity for Updating Operations".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent sebastian-graf.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent sebastian-belle.
- item-2 next item-3.
- item-2 previous item-1.