Sciweavers

7522 search results - page 325 / 1505
» Spacing memetic algorithms
Sort
View
IWDW
2009
Springer
15 years 11 months ago
Fast Embedding Technique for Dirty Paper Trellis Watermarking
This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate ...
Marc Chaumont
IJCNN
2000
IEEE
15 years 11 months ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
166
Voted
APPROX
2010
Springer
137views Algorithms» more  APPROX 2010»
15 years 8 months ago
Online Embeddings
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
Piotr Indyk, Avner Magen, Anastasios Sidiropoulos,...
NECO
1998
116views more  NECO 1998»
15 years 6 months ago
GTM: The Generative Topographic Mapping
Latent variable models represent the probability density of data in a space of several dimensions in terms of a smaller number of latent, or hidden, variables. A familiar example ...
Christopher M. Bishop, Markus Svensén, Chri...
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
15 years 5 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis