Sciweavers

1190 search results - page 208 / 238
» On the Structure of Syntenic Distance
Sort
View
WSCG
2004
185views more  WSCG 2004»
15 years 1 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
78
Voted
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
15 years 1 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
98
Voted
GIS
2008
ACM
15 years 1 months ago
Snapshot location-based query processing on moving objects in road networks
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
Haojun Wang, Roger Zimmermann
87
Voted
CGF
2010
111views more  CGF 2010»
15 years 17 days ago
One Point Isometric Matching with the Heat Kernel
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
Maks Ovsjanikov, Quentin Mérigot, Facundo M...
114
Voted
COR
2010
146views more  COR 2010»
15 years 17 days ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz