Sciweavers

1420 search results - page 95 / 284
» Multi-point Constructive Search
Sort
View
JODL
2000
201views more  JODL 2000»
15 years 3 months ago
A transaction log analysis of a digital library
As experimental digital library testbeds gain wider acceptance and develop significant user bases, it becomes important to investigate the ways in which users interact with the sy...
Steve Jones, Sally Jo Cunningham, Rodger J. McNab,...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 1 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
136
Voted
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 4 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
ICASSP
2008
IEEE
15 years 10 months ago
Kerdock codes for limited feedback MIMO systems
A codebook based limited feedback strategy is a practical way to obtain partial channel state information at the transmitter in a precoded multiple-input multiple-output (MIMO) wi...
Takao Inoue, Robert W. Heath Jr.
125
Voted
FOCS
2007
IEEE
15 years 10 months ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin