Sciweavers

536 search results - page 1 / 108
» Efficient Search Using Bitboard Models
Sort
View
ICTAI
2006
IEEE
13 years 11 months ago
Efficient Search Using Bitboard Models
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
Pablo San Segundo, Ramón Galán, Fern...
PVLDB
2008
146views more  PVLDB 2008»
13 years 4 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
PVLDB
2008
174views more  PVLDB 2008»
13 years 4 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
WWW
2006
ACM
14 years 5 months ago
Efficient search for peer-to-peer information retrieval using semantic small world
This paper proposes a semantic overlay based on the small world phenomenon that facilitates efficient search for information retrieval in unstructured P2P systems. In the semantic...
Hai Jin, Xiaomin Ning, Hanhua Chen
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 2 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...