2168 search results - page 65 / 434 » Randomized Algorithms and Complexity Theory |
124
click to vote
SDM
2010
SIAM
15 years 26 days ago
2010
SIAM
The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical...
117
click to vote
CC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
109
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
109
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
122
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...