Sciweavers

1604 search results - page 125 / 321
» Approximation algorithms for developable surfaces
Sort
View
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 2 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
146
Voted
CG
2006
Springer
15 years 1 months ago
Shape reasoning and understanding
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...
Bianca Falcidieno, Remco C. Veltkamp
141
Voted
ICPR
2006
IEEE
15 years 7 months ago
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
A novel stereo matching algorithm is proposed that utilizes color segmentation on the reference image and a selfadapting matching score that maximizes the number of reliable corre...
Andreas Klaus, Mario Sormann, Konrad F. Karner
VISUALIZATION
2000
IEEE
15 years 6 months ago
Constructing material interfaces from data sets with volume-fraction information
We present a new algorithm for material boundary interface reconstruction from data sets containing volume fractions. We transform the reconstruction problem to a problem that ana...
Kathleen S. Bonnell, Kenneth I. Joy, Bernd Hamann,...
COMPGEOM
2009
ACM
15 years 8 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...