363 search results - page 67 / 73 » Optimizing Memory Accesses For Spatial Computation |
155
click to vote
SIGMOD
2010
ACM
14 years 9 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
128
Voted
PSB
2003
15 years 3 months ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
138
Voted
MOBICOM
2009
ACM
15 years 9 months ago
2009
ACM
The coexistence of two unlicensed links is considered, where one link interferes with the transmission of the other, over a timevarying, block-fading channel. In the absence of fa...
117
Voted
SIAMSC
2008
15 years 2 months ago
2008
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...
138
Voted
TKDE
2011
14 years 6 months ago
2011
Given a positive value r, a distance based range query returns the objects that lie within the distance r of the query location.
In this paper, we focus on the distance based rang...