Sciweavers

73 search results - page 1 / 15
» Optimized Binary Search and Text Retrieval
Sort
View
ESA
1995
Springer
127views Algorithms» more  ESA 1995»
13 years 9 months ago
Optimized Binary Search and Text Retrieval
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
Eduardo F. Barbosa, Gonzalo Navarro, Ricardo A. Ba...
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 5 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
IUI
2009
ACM
14 years 2 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...
CIVR
2008
Springer
166views Image Analysis» more  CIVR 2008»
13 years 7 months ago
A probabilistic ranking framework using unobservable binary events for video search
Recent content-based video retrieval systems combine output of concept detectors (also known as high-level features) with text obtained through automatic speech recognition. This ...
Robin Aly, Djoerd Hiemstra, Arjen P. de Vries, Fra...
SIGIR
2010
ACM
13 years 9 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