Sciweavers

868 search results - page 58 / 174
» A general compression algorithm that supports fast searching
Sort
View
FOCS
1989
IEEE
14 years 1 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
CIKM
2004
Springer
14 years 2 months ago
Processing search queries in a distributed environment
Endeca’s approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using...
Frederick Knabe, Daniel Tunkelang
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 10 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
SIGIR
2004
ACM
14 years 2 months ago
Subwebs for specialized search
We describe a method to define and use subwebs, user-defined neighborhoods of the Internet. Subwebs help improve search performance by inducing a topic-specific page relevance ...
Raman Chandrasekar, Harr Chen, Simon Corston-Olive...
MM
2006
ACM
180views Multimedia» more  MM 2006»
14 years 2 months ago
Fast tracking of near-duplicate keyframes in broadcast domain with transitivity propagation
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
Chong-Wah Ngo, Wanlei Zhao, Yu-Gang Jiang