Sciweavers

7006 search results - page 152 / 1402
» Approximation Algorithms
Sort
View
113
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
139
Voted
ISITA
2010
15 years 21 days ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
133
Voted
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 5 days ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
122
Voted
HYBRID
2000
Springer
15 years 6 months ago
Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations
A general verification algorithm is described. It is then shown how ellipsoidal methods developed by A. B. Kurzhanski and P. Varaiya can be adapted to the algorithm. New numerical ...
Oleg Botchkarev, Stavros Tripakis
135
Voted
COMPGEOM
2000
ACM
15 years 7 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk