6393 search results - page 1080 / 1279 » Randomized Algorithms on the Mesh |
202
Voted
ICALP
2005
Springer
16 years 17 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
177
click to vote
ADHOCNOW
2004
Springer
16 years 14 days ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
253
Voted
ASIAN
2004
Springer
16 years 14 days ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
188
click to vote
SBIA
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
225
Voted
STOC
2010
ACM
15 years 12 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...