Sciweavers

559 search results - page 53 / 112
» Algorithms and Data Structures for External Memory
Sort
View
COMPGEOM
2005
ACM
15 years 4 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
SIGOPS
2010
91views more  SIGOPS 2010»
15 years 27 days ago
FastAD: an authenticated directory for billions of objects
We develop techniques that make authenticated directories efficient and scalable toward the goal of managing tens of billions of objects in a single directory. Internet storage s...
Paul T. Stanton, Benjamin McKeown, Randal C. Burns...
146
Voted
PLDI
2009
ACM
15 years 9 months ago
Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory
Multicore designs have emerged as the mainstream design paradigm for the microprocessor industry. Unfortunately, providing multiple cores does not directly translate into performa...
Mojtaba Mehrara, Jeff Hao, Po-Chun Hsu, Scott A. M...
CGF
2008
150views more  CGF 2008»
15 years 2 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
BMCBI
2005
84views more  BMCBI 2005»
15 years 2 months ago
A method of precise mRNA/DNA homology-based gene structure prediction
Background: Accurate and automatic gene finding and structural prediction is a common problem in bioinformatics, and applications need to be capable of handling non-canonical spli...
Alexander G. Churbanov, Mark Pauley, Daniel Quest,...