3874 search results - page 313 / 775 » Approximation Algorithms for k-hurdle Problems |
138
Voted
SECON
2007
IEEE
15 years 11 months ago
2007
IEEE
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
149
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
175
click to vote
SIAMJO
2002
15 years 4 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
130
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
135
click to vote
TIP
1998
15 years 4 months ago
1998
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...