5153 search results - page 389 / 1031 » Introduction to Randomized Algorithms |
181
click to vote
ESA
2011
Springer
14 years 4 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
126
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper we study the following problem: given two source images A and A , and a target image B, can we learn to synthesize a new image B which relates to B in the same way t...
144
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
123
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
134
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...