Sciweavers

1604 search results - page 103 / 321
» Approximation algorithms for developable surfaces
Sort
View
111
Voted
PG
2007
IEEE
15 years 7 months ago
Visualisation of Implicit Algebraic Curves
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
Lionel Alberti, Bernard Mourrain
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
16 years 2 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
MVA
2000
127views Computer Vision» more  MVA 2000»
15 years 1 months ago
Geometric fusion for a hand-held 3D sensor
This article presents a geometric fusion algorithm developed for the reconstruction of 3D surface models from hand-held sensor data. Hand-held systems allow full 3D movement of th...
Adrian Hilton, John Illingworth
FOCS
2009
IEEE
15 years 8 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
FOCS
2000
IEEE
15 years 5 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella