Sciweavers

9209 search results - page 1398 / 1842
» Data Space Randomization
Sort
View
IM
2007
15 years 6 months ago
Using the Power of Two Choices to Improve Bloom Filters
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
Steven S. Lumetta, Michael Mitzenmacher
TCS
2008
15 years 6 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
IVC
2007
184views more  IVC 2007»
15 years 6 months ago
Image distance functions for manifold learning
Many natural image sets are samples of a low-dimensional manifold in the space of all possible images. When the image data set is not a linear combination of a small number of bas...
Richard Souvenir, Robert Pless
IVC
2007
98views more  IVC 2007»
15 years 6 months ago
Reversible vectorisation of 3D digital planar curves and applications
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
Isabelle Sivignon, Florent Dupont, Jean-Marc Chass...
TKDE
2008
112views more  TKDE 2008»
15 years 6 months ago
IDD: A Supervised Interval Distance-Based Method for Discretization
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
Francisco J. Ruiz, Cecilio Angulo, Núria Ag...
« Prev « First page 1398 / 1842 Last » Next »