5019 search results - page 42 / 1004 » On the Reflexivity of Point Sets |
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
COMPGEOM
1993
ACM
14 years 18 days ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
IJCAI
2007
13 years 10 months ago
2007
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
COR
2008
13 years 8 months ago
2008
Whether a given nonlinear solver can reach a feasible point for a set of nonlinear constraints depends heavily on the initial point provided. We develop a range of computationally...
EMMCVPR
2001
Springer
14 years 1 months ago
2001
Springer
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...