12015 search results - page 1990 / 2403 » Interactive Algorithms 2005 |
179
click to vote
COLT
2005
Springer
16 years 11 days ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
174
click to vote
COLT
2005
Springer
16 years 11 days ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
176
click to vote
COMPLIFE
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. Most software tools in homology recognition on proteins answer only a few specific questions, often leaving not much room for the interpretation of the results. We devel...
187
click to vote
COMPLIFE
2005
Springer
16 years 11 days ago
2005
Springer
In the present paper we explain the basic ideas of Robust Perron Cluster Analysis (PCCA+) and exemplify the different application areas of this new and powerful method. Recently, ...
162
click to vote
CP
2005
Springer
16 years 11 days ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...