120 search results - page 19 / 24 » Randomized Lower Bounds for Online Path Coloring |
131
click to vote
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
147
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
129
click to vote
AHSWN
2008
15 years 4 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
141
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
144
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...