227 search results - page 32 / 46 » Complexity Results for Compressing Optimal Paths |
104
click to vote
SIGMETRICS
2008
ACM
14 years 11 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
113
click to vote
PERCOM
2006
ACM
15 years 10 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
EUROGRAPHICS
2010
Eurographics
15 years 7 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 ...
168
click to vote
ICDE
2005
IEEE
16 years 15 days ago
2005
IEEE
The SQL queries produced in XML-to-SQL query translation are often unnecessarily complex, even for simple input XML queries. In this paper we argue that relational systems can do ...
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...