Sciweavers

4541 search results - page 28 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 10 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
CG
2007
Springer
13 years 8 months ago
Visualizing and animating the winged-edge data structure
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
Bryan Neperud, John L. Lowther, Ching-Kuang Shene
SIAMSC
2011
85views more  SIAMSC 2011»
12 years 11 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
ICIP
2006
IEEE
14 years 10 months ago
Hierarchical Data Structure for Real-Time Background Subtraction
This paper seeks to increase the efficiency of background subtraction algorithms for motion detection. Our method uses a quadtree-base hierarchical framework that samples a small ...
Johnny Park, Amy Tabb, Avinash C. Kak
FGCS
2006
125views more  FGCS 2006»
13 years 8 months ago
Compressible memory data structures for event-based trace analysis
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
Andreas Knüpfer, Wolfgang E. Nagel