Sciweavers

1647 search results - page 110 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
VTC
2008
IEEE
179views Communications» more  VTC 2008»
15 years 11 months ago
Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
15 years 6 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
ALGORITHMICA
2011
14 years 12 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
AAAI
1994
15 years 6 months ago
Improving Learning Performance Through Rational Resource Allocation
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
Jonathan Gratch, Steve A. Chien, Gerald DeJong
ICALP
2009
Springer
16 years 5 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang