500 search results - page 49 / 100 » Approximation algorithms for maximum independent set of pseu... |
150
click to vote
ICANN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Learning algorithms relying on Gibbs sampling based stochastic approximations of the log-likelihood gradient have become a common way to train Restricted Boltzmann Machin...
102
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
116
click to vote
AAAI
2000
15 years 3 months ago
2000
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
116
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
102
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...