Sciweavers

39 search results - page 2 / 8
» Fast and Compact Prefix Codes
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
TCOM
2010
101views more  TCOM 2010»
13 years 2 months ago
Spectral efficient transmit diversity techniques without cyclic prefix for fading relay channels
Abstract--This paper proposes spectral efficient relayassisted transmit diversity techniques, i.e., space-time and space-frequency block codes (STBC/SFBC), for single carrier frequ...
Ui-Kun Kwon, Dae-Young Seol, Gi-Hong Im
CVPR
2012
IEEE
11 years 10 months ago
Fast search in Hamming space with multi-index hashing
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
Mohammad Emtiyaz Norouzi, Ali Punjani, David J. Fl...
ICNP
2007
IEEE
14 years 1 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
ISSS
1997
IEEE
102views Hardware» more  ISSS 1997»
13 years 11 months ago
An Efficient Model for DSP Code Generation: Performance, Code Size, Estimated Energy
This paper presents a model for simultaneous instruction selection, compaction, and register allocation. An arc mapping model along with logical propositions is used to create an ...
Catherine H. Gebotys