Sciweavers

1056 search results - page 109 / 212
» Constraint-Based Graph Matching
Sort
View
ENTCS
2008
106views more  ENTCS 2008»
13 years 9 months ago
Towards a Sharing Strategy for the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
ICIP
2009
IEEE
13 years 7 months ago
Windows and facades retrieval using similarity on graph of contours
The development of street-level geoviewers become recently a very active and challenging research topic. In this context, the detection, representation and classification of windo...
Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, F...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 3 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ICCS
1994
Springer
14 years 1 months ago
UDS: A Universal Data Structure
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, ...
Robert Levinson
CG
2007
Springer
13 years 9 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere