Sciweavers

4047 search results - page 259 / 810
» The Discrete Basis Problem
Sort
View
143
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
Jointly optimal bit loading, channel pairing and power allocation for multi-channel relaying
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
Mahdi Hajiaghayi, Min Dong, Ben Liang
DAC
2000
ACM
16 years 5 months ago
Large-scale capacitance calculation
We describe a new method for accurate large-scale capacitance calculations. The algorithm uses an integral equation formulation, but with a new representation for charge distribut...
Sharad Kapur, David E. Long
153
Voted
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
16 years 1 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu
ICRA
2007
IEEE
107views Robotics» more  ICRA 2007»
15 years 10 months ago
Optimal control subsumes harmonic control
Abstract— We consider trajectory planning within the frameworks of optimal control and harmonic control. We present a formal evidence, in the continuous domain and in a standard ...
Amine M. Boumaza, Bruno Scherrer
COMPGEOM
2006
ACM
15 years 10 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii