Sciweavers

31 search results - page 5 / 7
» Tree patterns with Full Text Search
Sort
View
SIGIR
2010
ACM
13 years 10 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
FOCS
2009
IEEE
13 years 10 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
GBRPR
2007
Springer
13 years 10 months ago
An Efficient Ontology-Based Expert Peering System
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
Tansu Alpcan, Christian Bauckhage, Sachin Agarwal
IR
2008
13 years 6 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
SIGIR
2005
ACM
13 years 11 months ago
Impedance coupling in content-targeted advertising
The current boom of the Web is associated with the revenues originated from on-line advertising. While search-based advertising is dominant, the association of ads with a Web page...
Berthier A. Ribeiro-Neto, Marco Cristo, Paulo Braz...