Sciweavers

2735 search results - page 91 / 547
» Comparing notions of randomness
Sort
View
CP
2006
Springer
14 years 20 days ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
IWCMC
2010
ACM
13 years 11 months ago
On the use of random neural networks for traffic matrix estimation in large-scale IP networks
Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a ...
Pedro Casas, Sandrine Vaton
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
JMLR
2008
159views more  JMLR 2008»
13 years 9 months ago
Dynamic Hierarchical Markov Random Fields for Integrated Web Data Extraction
Existing template-independent web data extraction approaches adopt highly ineffective decoupled strategies--attempting to do data record detection and attribute labeling in two se...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen
TMI
1998
155views more  TMI 1998»
13 years 8 months ago
Spatio-temporal fMRI Analysis using Markov Random Fields
Abstract—Functional magnetic resonance images (fMRI’s) provide high-resolution datasets which allow researchers to obtain accurate delineation and sensitive detection of activa...
Xavier Descombes, Frithjof Kruggel, D. Yves von Cr...