6393 search results - page 335 / 1279 » Randomized Algorithms on the Mesh |
179
click to vote
WAW
2009
Springer
16 years 1 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
186
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
164
click to vote
ESA
2004
Springer
16 years 2 days ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
166
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
201
click to vote
PAMI
2008
15 years 6 months ago
2008
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...