Sciweavers

773 search results - page 13 / 155
» Traversing the Machining Graph
Sort
View
SIAMDM
2008
77views more  SIAMDM 2008»
13 years 9 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
ICCV
2007
IEEE
14 years 4 months ago
Monocular SLAM as a Graph of Coalesced Observations
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
Ethan Eade, Tom Drummond
ENTCS
2006
162views more  ENTCS 2006»
13 years 9 months ago
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
Gergely Varró, Katalin Friedl, Dánie...
ICML
2004
IEEE
14 years 10 months ago
Extensions of marginalized graph kernels
Jean-Luc Perret, Jean-Philippe Vert, Nobuhisa Ueda...
SE
2010
13 years 11 months ago
Towards Information Flow Auditing in Workflows
: The paper proposes an approach for compliance audits in workflow environments based on the tracking of information flow. Requirements are formalized as a binary relation on the w...
Claus Wonnemann