2520 search results - page 293 / 504 » The complexity of approximating entropy |
178
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
173
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
153
click to vote
AAAI
2008
15 years 9 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
156
click to vote
BIOCOMP
2008
15 years 8 months ago
2008
- Here proposed apriori method for identification of protein flexibility relies on one end-state conformation of the protein. This method has comparative advantage over many others...
187
click to vote
NIPS
2007
15 years 8 months ago
2007
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...