Sciweavers

11211 search results - page 1757 / 2243
» Rank-Sensitive Data Structures
Sort
View
CVPR
2010
IEEE
15 years 7 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 7 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
ASAP
2008
IEEE
161views Hardware» more  ASAP 2008»
15 years 7 months ago
Configurable and scalable high throughput turbo decoder architecture for multiple 4G wireless standards
In this paper, we propose a novel multi-code turbo decoder architecture for 4G wireless systems. To support various 4G standards, a configurable multi-mode MAP (maximum a posterio...
Yang Sun, Yuming Zhu, Manish Goel, Joseph R. Caval...
CAISE
2008
Springer
15 years 7 months ago
On the Definition of Service Granularity and Its Architectural Impact
Service granularity generally refers to the size of a service. The fact that services should be large-sized or coarse-grained is often postulated as a fundamental design principle ...
Raf Haesen, Monique Snoeck, Wilfried Lemahieu, Ste...
144
Voted
CIKM
2008
Springer
15 years 7 months ago
Web-scale named entity recognition
Automatic recognition of named entities such as people, places, organizations, books, and movies across the entire web presents a number of challenges, both of scale and scope. Da...
Casey Whitelaw, Alexander Kehlenbeck, Nemanja Petr...
« Prev « First page 1757 / 2243 Last » Next »