3894 search results - page 488 / 779 » Approximation Algorithms for Biclustering Problems |
139
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper deals with the reconstruction of smooth, flexible, isometrically embedded flat surfaces in 3D, such as a sheet of paper or a flag waving in the wind, from a set of 2...
118
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
In a reverberant scenario, phase transformed weighted algorithms are more robust than Maximum Likelihood (ML) because of the insufficiency of the data model to incorporate reverb...
147
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
130
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
132
click to vote
SMA
2006
ACM
15 years 10 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...