Matches in ScholarlyData for { ?s ?p ?o. }
- 674 sameAs 674.
- 674 abstract "User search activities on the Web are getting more and more specialized: users expect more precise domain-specific results from search engines and typically perform complex tasks that involve exploratory, multi-step search processes. In this paper we propose the Liquid Query paradigm, that allows users finding responses to multi-domain queries through an exploratory information seeking approach, upon structured information collected from Web documents, deep Web data sources, and personal data repositories, wrapped by means of a uniform notion of search service. Liquid queries aim at filling the gap between generalized search systems, which are unable to find information spanning multiple topics, and domain-specific search systems, which cannot go beyond their domain limits. Liquid query provides a set of interaction primitives that let users make questions and explore results spanning over multiple sources, thus getting closer and closer to the sought information. We demonstrate our approach with a prototype built upon the YQL (Yahoo! Query Language) framework.".
- 674 hasAuthorList authorList.
- 674 isPartOf proceedings.
- 674 keyword "Exploratory search".
- 674 keyword "sensemaking".
- 674 title "Liquid Query: Multi-domain Exploratory Search on the Web".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent marco-brambilla.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent alessandro-bozzon.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent stefano-ceri.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent piero-fraternali.
- item-4 previous item-3.
- 68 creator leo-meyerovich.
- 68 creator ras-bodik.
- 68 type InProceedings.
- 68 label "Fast and Parallel Webpage Layout".
- 68 sameAs 68.
- 68 abstract "The web browser is a CPU-intensive program. Especially on mobile devices, loading of webpages is too slow, spending much of its time in processing a document's appearance. Due to power constraints, most hardware improvements will come in the form of parallel architectures. This is also true of mobile devices such as phones. Current browsers, however, do not yet fully exploit hardware parallelism, so we are designing a parallel mobile browser. In this paper, we introduce new algorithms for CSS selector matching, layout solving, and font rendering, which represent key components for a fast layout engine. Evaluation on popular sites shows speedups as high as 80x. We also formulate layout solving with attribute grammars, enabling us to not only parallelize our algorithm but prove that it computes in O(log) time and without reflow.".
- 68 hasAuthorList authorList.
- 68 isPartOf proceedings.
- 68 keyword "Improving the performance".
- 68 keyword "availability of real-world Web systems".
- 68 keyword "scalability".
- 68 title "Fast and Parallel Webpage Layout".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent leo-meyerovich.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent ras-bodik.
- item-2 previous item-1.
- 691 creator ravi-kumar.
- 691 creator sergei-vassilvitskii.
- 691 type InProceedings.
- 691 label "Generalized Distances between Rankings".
- 691 sameAs 691.
- 691 abstract "Spearman's footrule and Kendall's tau are two well established distances between rankings. However, they fail to take into account concepts crucial to evaluating a result set in information retrieval, element relevance and positional information. That is changing the rank of a highly-relevant document should result in a higher penalty than changing the rank of a irrelevant document; similar logic holds for results top positions, versus the bottom of the order. In this work, we extend both of these metrics to those with position and element weights, and show that a variant of the Diaconis-Graham inequality still holds---two measures remain within a constant factor of each other for all permutations. We continue by extending the element weights into a distance metric between elements. For example, in search evaluation, swapping the order of two nearly duplicate results should result in little penalty, even if these two are highly relevant and appear at the top of the list. We extend the rank similarity metrics to this, more general case, and show that they remain within a constant factor of each other. We conclude by conducting simple experiments on web search data with the proposed measures. Our experiments show that the weighted generalizations are more robust and consistent with each other than their unweighted counterparts.".
- 691 hasAuthorList authorList.
- 691 isPartOf proceedings.
- 691 keyword "Search engine evaluation".
- 691 keyword "measurements".
- 691 title "Generalized Distances between Rankings".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent ravi-kumar.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent sergei-vassilvitskii.
- item-2 previous item-1.
- 692 creator daniel-huttenlocher.
- 692 creator jon-kleinberg.
- 692 creator jure-leskovec.
- 692 type InProceedings.
- 692 label "Predicting Positive and Negative Links in Online Social Networks".
- 692 sameAs 692.
- 692 abstract "We study online social networks in which relationships can be both positive (indicating friendship) and negative (indicating opposition or antagonism). Such a mix of positive and negative links arise in a variety of online settings; we study datasets from Epinions, Slashdot and Wikipedia. Despite the diversity of settings considered, we find that the signs of links in the underlying social networks can be predicted with high accuracy using models that generalize across the different domains. These models provide insight into some of the fundamental principles that drive the formation of signed links in networks, and also shed light on theories of balance and status from social psychology.".
- 692 hasAuthorList authorList.
- 692 isPartOf proceedings.
- 692 keyword "Analysis of online communities including blogs".
- 692 keyword "social media sites".
- 692 keyword "tagging systems".
- 692 title "Predicting Positive and Negative Links in Online Social Networks".
- 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 jure-leskovec.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent daniel-huttenlocher.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.