Sciweavers

989 search results - page 18 / 198
» Version spaces and the consistency problem
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
ISCIS
2005
Springer
14 years 1 months ago
Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
Margarida Mamede
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 1 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
GI
2009
Springer
14 years 11 days ago
Tapir: Language Support to Reduce the State Space in Model-Checking
: Model-checking is a way of testing the correctness of concurrent programs. To do so, a model of the program is proven to match properties and constraints specified by the progra...
Ronald Veldema, Michael Philippsen
FC
2004
Springer
94views Cryptology» more  FC 2004»
14 years 1 months ago
The Ephemeral Pairing Problem
Abstract In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not...
Jaap-Henk Hoepman