845 search results - page 47 / 169 » Complexity Dimensions and Learnability |
125
click to vote
UAI
1996
15 years 3 months ago
1996
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
DM
2008
15 years 2 months ago
2008
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
119
click to vote
ECUMN
2007
Springer
15 years 8 months ago
2007
Springer
Measurement of network traffic is a fundamental issue to manage the network itself. The highly selfsimilar nature of IP traffic makes its measurement and profiling a very complex ...
123
click to vote
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
128
click to vote
DCG
2010
14 years 12 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...