Sciweavers

2969 search results - page 238 / 594
» A space efficient algorithm for group structure computation
Sort
View
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 4 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
130
Voted
WSCG
2004
197views more  WSCG 2004»
15 years 5 months ago
Collision Prediction Using MKtrees
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
Marta Franquesa-Niubó, Pere Brunet
ICPR
2000
IEEE
16 years 5 months ago
A Parallel Algorithm for Tracking of Segments in Noisy Edge Images
We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution ?a set of segments that reason...
Pedro E. López-de-Teruel, Alberto Ruiz, Jos...
3DIM
2003
IEEE
15 years 7 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
MM
2009
ACM
187views Multimedia» more  MM 2009»
15 years 8 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...