Sciweavers

52 search results - page 11 / 11
» Testing Euclidean minimum spanning trees in the plane
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
BMCBI
2008
87views more  BMCBI 2008»
13 years 5 months ago
Protein structure search and local structure characterization
Background: Structural similarities among proteins can provide valuable insight into their functional mechanisms and relationships. As the number of available three-dimensional (3...
Shih-Yen Ku, Yuh-Jyh Hu