221 search results - page 32 / 45 » Graph matching with type constraints on nodes and edges |
ICDAR
2005
IEEE
14 years 1 months ago
2005
IEEE
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
Motivated to a large extent by the substantial and growing prominence of the World-Wide Web and the potential benefits that may be obtained by applying database concepts and tech...
AAAI
2007
13 years 10 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...