5153 search results - page 789 / 1031 » Introduction to Randomized Algorithms |
111
Voted
ADMA
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
120
Voted
ANNPR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
150
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
133
Voted
CPM
2004
Springer
15 years 7 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
146
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...