Sciweavers

4850 search results - page 58 / 970
» Approximate Data Structures with Applications
Sort
View
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
15 years 10 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
SCM
2003
14 years 11 months ago
Merging Collection Data Structures in a Content Management System
Abstract. Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a spe...
Axel Wienberg
96
Voted
IPMI
2003
Springer
15 years 10 months ago
Meshfree Representation and Computation: Applications to Cardiac Motion Analysis
Abstract. For medical image analysis issues where the domain mappings between images involve large geometrical shape changes, such as the cases of nonrigid motion recovery and inte...
Huafeng Liu, Pengcheng Shi
TROB
2008
154views more  TROB 2008»
14 years 8 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós
WEBI
2009
Springer
15 years 4 months ago
Revealing Hidden Community Structures and Identifying Bridges in Complex Networks: An Application to Analyzing Contents of Web P
The emergence of scale free and small world properties in real world complex networks has stimulated lots of activity in the field of network analysis. An example of such a netwo...
Faraz Zaidi, Arnaud Sallaberry, Guy Melanço...