Sciweavers

6365 search results - page 33 / 1273
» Fast Local Computation Algorithms
Sort
View
112
Voted
ICDCS
2010
IEEE
15 years 4 months ago
A New Buffer Cache Design Exploiting Both Temporal and Content Localities
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
Jin Ren, Qing Yang
110
Voted
CVPR
2010
IEEE
15 years 2 months ago
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes
Background modeling plays an important role in video surveillance, yet in complex scenes it is still a challenging problem. Among many difficulties, problems caused by illuminatio...
Shengcai Liao, Guoying Zhao, Vili Kellokumpu, Matt...
122
Voted
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop
87
Voted
ICALP
2005
Springer
15 years 6 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
ICPP
2003
IEEE
15 years 5 months ago
FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
Adrian Driga, Paul Lu, Jonathan Schaeffer, Duane S...