Sciweavers

666 search results - page 107 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 20 days ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
ADBIS
2008
Springer
117views Database» more  ADBIS 2008»
13 years 11 months ago
Reclassification of Linearly Classified Data Using Constraint Databases
In many problems the raw data is already classified according to a variety of features using some linear classification algorithm but needs to be reclassified. We introduce a novel...
Peter Z. Revesz, Thomas Triplet
3DPVT
2006
IEEE
257views Visualization» more  3DPVT 2006»
14 years 3 months ago
3D from Line Segments in Two Poorly-Textured, Uncalibrated Images
This paper addresses the problem of camera selfcalibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we ge...
Herbert Bay, Andreas Ess, Alexander Neubeck, Luc J...
DAM
2011
13 years 4 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
GD
2005
Springer
14 years 2 months ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....