261 search results - page 28 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
100
click to vote
DCOSS
2009
Springer
15 years 8 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
146
Voted
QSHINE
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract— Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusi...
100
click to vote
ICCAD
2009
IEEE
14 years 11 months ago
2009
IEEE
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...
102
click to vote
UAI
2004
15 years 3 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
100
click to vote
DAM
2010
15 years 1 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...