Sciweavers

363 search results - page 67 / 73
» Optimizing Memory Accesses For Spatial Computation
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 2 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
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...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
PSB
2003
13 years 9 months ago
MAP: Searching Large Genome Databases
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...
Tamer Kahveci, Ambuj K. Singh
MOBICOM
2009
ACM
14 years 2 months ago
Interference management via rate splitting and HARQ over time-varying fading channels
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...
Marco Levorato, Osvaldo Simeone, Urbashi Mitra
SIAMSC
2008
131views more  SIAMSC 2008»
13 years 7 months ago
Fast Monte Carlo Simulation Methods for Biological Reaction-Diffusion Systems in Solution and on Surfaces
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...
Rex A. Kerr, Thomas M. Bartol, Boris Kaminsky, Mar...
TKDE
2011
266views more  TKDE 2011»
12 years 11 months ago
Continuous Monitoring of Distance Based Range Queries
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...
Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin ...