Sciweavers

244 search results - page 9 / 49
» Fast Set Intersection in Memory
Sort
View
ISPAN
2005
IEEE
14 years 1 months ago
P2P Architecture for Self-Atomic Memory
We propose an architecture for self-adjusting and self-healing atomic memory in highly dynamic systems exploiting peer-to-peer (p2p) techniques. Our approach, named SAM, brings to...
Emmanuelle Anceaume, Maria Gradinariu, Vincent Gra...
CVPR
2004
IEEE
14 years 9 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden
BMVC
2010
13 years 5 months ago
FAST: Fast Adaptive Silhouette Area based Template Matching
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
Daniel Mohr, Gabriel Zachmann
WSCG
2000
153views more  WSCG 2000»
13 years 9 months ago
RaFSi - A Fast Watershed Algorithm Based on Rainfalling Simulation
In this paper, we present a fast watershed algorithm based on the rainfalling simulation. We present the various techniques and data structures utilized in our approach. Throughou...
Stanislav L. Stoev
PR
2006
122views more  PR 2006»
13 years 7 months ago
Fast multiscale clustering and manifold identification
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
Dan Kushnir, Meirav Galun, Achi Brandt