Sciweavers

432 search results - page 24 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
ACCV
2010
Springer
13 years 2 months ago
Image-Based 3D Modeling via Cheeger Sets
We propose a novel variational formulation for generating 3D models of objects from a single view. Based on a few user scribbles in an image, the algorithm automatically extracts t...
Eno Töppe, Martin R. Oswald, Daniel Cremers, ...
JCAM
2010
82views more  JCAM 2010»
13 years 2 months ago
Menke points on the real line and their connection to classical orthogonal polynomials
Abstract. We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show th...
P. Mathur, J. S. Brauchart, Edward B. Saff
JGAA
2000
179views more  JGAA 2000»
13 years 7 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
IPL
1998
119views more  IPL 1998»
13 years 7 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
ENTCS
2007
190views more  ENTCS 2007»
13 years 7 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...