14518 search results - page 185 / 2904 » Two Problems for Sophistication |
RECOMB
2005
Springer
14 years 11 months ago
2005
Springer
We develop an iterative relaxation algorithm, called RIBRA, for NMR protein backbone assignment. RIBRA applies nearest neighbor and weighted maximum independent set algorithms to ...
3DPVT
2006
IEEE
14 years 4 months ago
2006
IEEE
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
CPM
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
AIPS
2006
14 years 5 days ago
2006
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
AAAI
1996
14 years 3 days ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...