1986 search results - page 213 / 398 » Path Separability of Graphs |
128
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 10 months ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
152
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
140
click to vote
NETWORKS
2002
15 years 2 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
206
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
127
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...