3894 search results - page 211 / 779 » Approximation Algorithms for Biclustering Problems |
194
click to vote
ECCV
2000
Springer
15 years 11 months ago
2000
Springer
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
208
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
160
click to vote
ISSAC
2004
Springer
15 years 12 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
169
click to vote
ALGOSENSORS
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
223
click to vote
JCSS
2008
15 years 6 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...