Sciweavers

511 search results - page 34 / 103
» TSP with bounded metrics
Sort
View
ICCV
2007
IEEE
15 years 11 months ago
Globally Optimal Affine and Metric Upgrades in Stratified Autocalibration
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
Manmohan Krishna Chandraker, Sameer Agarwal, David...
ICML
2007
IEEE
15 years 10 months ago
Information-theoretic metric learning
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
Jason V. Davis, Brian Kulis, Prateek Jain, Suvrit ...
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
14 years 11 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
ICALP
2004
Springer
15 years 3 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
14 years 11 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein