1424 search results - page 105 / 285 » The Multi-radius Cover Problem |
129
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
144
Voted
SODA
2010
ACM
16 years 27 days ago
2010
ACM
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...
127
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
113
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
101
click to vote
ITC
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper describes a system for performing high precision IDDQ measurement of CMOS ICs having a large peak current during operation. Although the measurement rate is at a low sp...