Sciweavers

845 search results - page 47 / 169
» Complexity Dimensions and Learnability
Sort
View
102
Voted
UAI
1996
15 years 2 months ago
Asymptotic Model Selection for Directed Networks with Hidden Variables
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
Dan Geiger, David Heckerman, Christopher Meek
66
Voted
DM
2008
50views more  DM 2008»
15 years 23 days ago
Searching monotone multi-dimensional arrays
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 ...
Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin
102
Voted
ECUMN
2007
Springer
15 years 6 months ago
Measuring and Profiling IP Traffic
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 ...
Nuno M. Garcia, Paulo P. Monteiro, Mário M....
COMPGEOM
2008
ACM
15 years 2 months ago
Towards persistence-based reconstruction in euclidean spaces
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...
Frédéric Chazal, Steve Oudot
110
Voted
DCG
2010
104views more  DCG 2010»
14 years 10 months ago
Vietoris-Rips Complexes of Planar Point Sets
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...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...