Sciweavers

180 search results - page 23 / 36
» Measure on P: Robustness of the Notion
Sort
View
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
13 years 8 months ago
The similarity metric
—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...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
TIFS
2008
133views more  TIFS 2008»
13 years 7 months ago
Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding
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...
François Cayre, Patrick Bas
MIA
2010
170views more  MIA 2010»
13 years 2 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
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 ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
14 years 4 months ago
Streaming Algorithms for extent problems in high dimensions
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...
Pankaj K Agarwal, R. Sharathkumar
MSV
2004
13 years 9 months ago
MABAC - Matrix Based Clustering Algorithm
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...
Yonghui Chen, Alan P. Sprague, Kevin D. Reilly