3894 search results - page 321 / 779 » Approximation Algorithms for Biclustering Problems |
211
click to vote
IPSN
2005
Springer
16 years 24 days 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...
175
click to vote
TIP
1998
15 years 7 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...
191
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
199
click to vote
COMPGEOM
2004
ACM
16 years 22 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
203
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...