4541 search results - page 514 / 909 » Cache-Oblivious Algorithms and Data Structures |
199
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
179
Voted
WWW
2011
ACM
15 years 1 months ago
2011
ACM
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
211
Voted
TSP
2010
15 years 1 months ago
2010
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
157
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
307
Voted
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...