180 search results - page 23 / 36 » Measure on P: Robustness of the Notion |
103
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
160
click to vote
TIFS
2008
15 years 1 months ago
2008
Abstract-- It has recently been discovered that using pseudorandom sequences as carriers in spread-spectrum techniques for data-hiding is not at all a sufficient condition for ensu...
118
click to vote
MIA
2010
14 years 8 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
105
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
131
click to vote
MSV
2004
15 years 2 months ago
2004
Clustering is a prominent method in the data mining field. It is a discovery process that groups data such that intra cluster similarity is maximized and the inter cluster similar...