562 search results - page 30 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
72
Voted
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
70
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
70
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...