241 search results - page 18 / 49 » Shape Analysis as a Generalized Path Problem |
134
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
112
click to vote
SIGECOM
2005
ACM
15 years 8 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
137
click to vote
SMA
2003
ACM
15 years 7 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
118
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
108
click to vote
STACS
2004
Springer
15 years 7 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...