3894 search results - page 188 / 779 » Approximation Algorithms for Biclustering Problems |
150
click to vote
DAM
2006
15 years 6 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
163
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
230
click to vote
ESANN
2000
15 years 7 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
184
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...
161
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...