Sciweavers

246 search results - page 3 / 50
» Efficient Algorithms for Inverting Evolution
Sort
View
IKE
2003
13 years 9 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
WWW
2003
ACM
14 years 8 months ago
Dynamic maintenance of web indexes using landmarks
Recent work on incremental crawling has enabled the indexed document collection of a search engine to be more synchronized with the changing World Wide Web. However, this synchron...
Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 7 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 5 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
JSAC
2010
132views more  JSAC 2010»
13 years 2 months ago
Very Efficient Balanced Codes
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated...
K. Schouhamer Immink, J. Weber