4377 search results - page 313 / 876 » Mass problems and randomness |
177
click to vote
ICIP
1998
IEEE
16 years 8 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
164
click to vote
ICRA
2009
IEEE
16 years 1 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...
165
click to vote
NICSO
2010
Springer
16 years 1 months ago
2010
Springer
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
178
click to vote
FSTTCS
2004
Springer
16 years 4 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
159
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...