Sciweavers

138 search results - page 27 / 28
» Bit-probe lower bounds for succinct data structures
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 10 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
14 years 2 months ago
Post-placement voltage island generation
High power consumption will shorten battery life for handheld devices and cause thermal and reliability problems. One way to lower the dynamic power consumption is to reduce the s...
Royce L. S. Ching, Evangeline F. Y. Young, Kevin C...
ICNP
2006
IEEE
13 years 11 months ago
O-MAC: A Receiver Centric Power Management Protocol
— Energy efficiency is widely understood to be one of the dominant considerations for Wireless Sensor Networks. Based on historical data and technology trends, the receiver ener...
Hui Cao, Ken Parker, Anish Arora
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
13 years 10 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 9 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts