Sciweavers

2252 search results - page 185 / 451
» Improving Random Forests
Sort
View
ICASSP
2008
IEEE
15 years 9 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
ICC
2007
IEEE
144views Communications» more  ICC 2007»
15 years 9 months ago
Binary Repetition Codes and SPC Product Codes for Coded and Cooperative Diversity Systems
— A three stage network protocol that can achieve coded and cooperative diversity to improve network coverage is investigated. In Stage 1, a cyclic redundancy check code is used ...
Pavel Loskot, Norman C. Beaulieu
115
Voted
SIGIR
2010
ACM
15 years 6 months ago
Context aware query classification using dynamic query window and relationship net
The context of the user queries, preceding a given query, is utilized to improve the effectiveness of query classification. Earlier efforts utilize fixed number of preceding queri...
Nazli Goharian, Saket S. R. Mengle
120
Voted
CMS
2003
101views Communications» more  CMS 2003»
15 years 4 months ago
Watermark Security via Secret Wavelet Packet Subband Structures
Abstract. Wavelet packet decompositions generalize the classical pyramidal wavelet structure. We use the vast amount of possible wavelet packet decomposition structures to create a...
Werner Dietl, Andreas Uhl
COMGEO
2010
ACM
15 years 2 months ago
Approximate centerpoints with proofs
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
Gary L. Miller, Donald Sheehy