2880 search results - page 247 / 576 » Approximate Range Searching |
142
click to vote
CONNECTION
2007
15 years 3 months ago
2007
In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory...
128
click to vote
SAC
2008
ACM
15 years 3 months ago
2008
ACM
This paper proposes an address compression technique for load/store queue (LSQ) to improve the scalability and power efficiency. A load/store queue (LSQ) typically needs a fullyas...
123
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
159
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
133
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...