340 search results - page 40 / 68 » Clustering with Lower Bound on Similarity |
STACS
2000
Springer
15 years 4 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
104
click to vote
AIPS
2008
15 years 3 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
110
Voted
ORDER
2002
15 years 12 days ago
2002
We determine the order dimension of the strong Bruhat order on finite Coxeter groups of types A, B and H. The order dimension is determined using a generalization of a theorem of D...
102
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
110
click to vote
BMCBI
2010
15 years 26 days ago
2010
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...