Sciweavers

4972 search results - page 785 / 995
» Ranking on graph data
Sort
View
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 7 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
KDD
2007
ACM
169views Data Mining» more  KDD 2007»
16 years 7 months ago
Exploiting underrepresented query aspects for automatic query expansion
Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely ...
Daniel Crabtree, Peter Andreae, Xiaoying Gao
ICALP
2009
Springer
16 years 6 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
16 years 6 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
16 years 3 months ago
Learning Concept Importance Using a Weighted Dependence Model
Modeling query concepts through term dependencies has been shown to have a significant positive effect on retrieval performance, especially for tasks such as web search, where rel...
Michael Bendersky, Donald Metzler, W. Bruce Croft