1578 search results - page 29 / 316 » Algorithmic randomness of continuous functions |
135
Voted
COCO
2009
Springer
15 years 6 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
130
click to vote
JMLR
2008
15 years 7 days ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
BMVC
2010
14 years 10 months ago
2010
This paper studies image segmentation based on the minimum description length (MDL) functional combining spatial regularization with a penality for the number of distinct segments...
100
click to vote
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
111
Voted
ICPP
2005
IEEE
15 years 5 months ago
2005
IEEE
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...