Sciweavers

29908 search results - page 5974 / 5982
» On the complexity of communication complexity
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
OSDI
2004
ACM
14 years 8 months ago
Improving the Reliability of Internet Paths with One-hop Source Routing
Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, tr...
P. Krishna Gummadi, Harsha V. Madhyastha, Steven D...
EUROSYS
2007
ACM
14 years 4 months ago
Adaptive control of virtualized resources in utility computing environments
Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utili...
Pradeep Padala, Kang G. Shin, Xiaoyun Zhu, Mustafa...
ICRA
2009
IEEE
176views Robotics» more  ICRA 2009»
14 years 2 months ago
Rollin' Justin - Mobile platform with variable base
Abstract— Research on humanoid robots for use in servicing tasks, e.g. fetching and delivery, attracts steadily more interest. With ”Rollin’ Justin” a mobile robotic system...
Christoph Borst, Thomas Wimböck, Florian Schm...
« Prev « First page 5974 / 5982 Last » Next »