Sciweavers

198 search results - page 8 / 40
» On the Lower Bound of Local Optimums in K-Means Algorithm
Sort
View
SPAA
2009
ACM
14 years 7 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
13 years 10 months ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...
MMS
1998
13 years 6 months ago
Packet Audio Playout Delay Adjustment: Performance Bounds and Algorithms
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...
Sue B. Moon, James F. Kurose, Donald F. Towsley
WIOPT
2010
IEEE
13 years 4 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 8 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...