Sciweavers

108 search results - page 11 / 22
» On Computing the Centroid of the Vertices of an Arrangement ...
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
SIGMOD
2008
ACM
125views Database» more  SIGMOD 2008»
14 years 7 months ago
Categorical skylines for streaming data
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. ...
SIAMIS
2011
13 years 2 months ago
A New Geometric Metric in the Space of Curves, and Applications to Tracking Deforming Objects by Prediction and Filtering
We define a novel metric on the space of closed planar curves which decomposes into three intuitive components. According to this metric centroid translations, scale changes and ...
Ganesh Sundaramoorthi, Andrea Mennucci, Stefano So...
ECCV
2008
Springer
14 years 9 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
JEA
2006
90views more  JEA 2006»
13 years 7 months ago
Heuristics for estimating contact area of supports in layered manufacturing
Layered Manufacturing is a technology that allows physical prototypes of three-dimensional models to be built directly from their digital representation, as a stack of two-dimensi...
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid,...