Sciweavers

989 search results - page 66 / 198
» Version spaces and the consistency problem
Sort
View
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 2 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
PR
2007
81views more  PR 2007»
13 years 9 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
REX
1991
14 years 1 months ago
The Theory of Timed Automata
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
Rajeev Alur, David L. Dill
ISVC
2009
Springer
14 years 4 months ago
Real-Time 3D Reconstruction for Occlusion-Aware Interactions in Mixed Reality
In this paper, we present a system for performing real-time occlusion-aware interactions in a mixed reality environment. Our system consists of 16 ceiling-mounted cameras observing...
Alexander Ladikos, Nassir Navab
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
14 years 3 months ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre