Sciweavers

1023 search results - page 170 / 205
» Graph model selection using maximum likelihood
Sort
View
DM
2007
83views more  DM 2007»
15 years 2 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...
136
Voted
NETWORKS
2007
15 years 2 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
124
Voted
UAI
2000
15 years 3 months ago
Variational Relevance Vector Machines
The Support Vector Machine (SVM) of Vapnik [9] has become widely established as one of the leading approaches to pattern recognition and machine learning. It expresses predictions...
Christopher M. Bishop, Michael E. Tipping
141
Voted
ICA
2010
Springer
15 years 3 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 8 months ago
Local and global order 3/2 convergence of a surrogate evolutionary algorithm
A Quasi-Monte-Carlo method based on the computation of a surrogate model of the fitness function is proposed, and its convergence at super-linear rate 3/2 is proved under rather ...
Anne Auger, Marc Schoenauer, Olivier Teytaud