2294 search results - page 227 / 459 » From Path Graphs to Directed Path Graphs |
138
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
134
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 11 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 ...
150
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 ...
140
click to vote
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
Indoor ranging and location in WLAN is possible through obtaining Round-Trip-Time (RTT) measurements at data link level. This procedure allows using the existing IEEE 802.11 WLAN ...
214
click to vote
ICDE
2007
IEEE
16 years 4 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,...