70 search results - page 3 / 14 » Optimal reconstruction might be hard |
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
BIRD
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We propose a computational method for reconstructing metabolic networks. The method utilizes optimization techniques and graph traversal algorithms to discover a set of b...
SODA
2000
ACM
13 years 7 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...