5785 search results - page 564 / 1157 » Approximability of Probability Distributions |
134
click to vote
CSB
2005
IEEE
16 years 20 days ago
2005
IEEE
Recently Bowers et al. [1] analyzed triplet logic relationships among 4873 Clusters of Orthologous Groups (COGS) from 67 fully sequenced organisms by calculating how well logic re...
172
click to vote
ICPP
1997
IEEE
15 years 11 months ago
1997
IEEE
Communication characterization of parallel applications is essential to understand the interplay between architectures and applications in determining the maximum achievable perfo...
205
click to vote
ALT
1997
Springer
15 years 11 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
218
click to vote
COMPGEOM
1996
ACM
15 years 11 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
143
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Bayesian model averaging, model selection and its approximations such as BIC are generally statistically consistent, but sometimes achieve slower rates of convergence than other m...