Sciweavers

11211 search results - page 1668 / 2243
» Rank-Sensitive Data Structures
Sort
View
IM
2007
15 years 7 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 7 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
TCS
2008
15 years 7 months ago
Succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
TCSV
2008
174views more  TCSV 2008»
15 years 7 months ago
A Survey of Vision-Based Trajectory Learning and Analysis for Surveillance
Abstract--This paper presents a survey of trajectory-based activity analysis for visual surveillance. It describes techniques that use trajectory data to define a general set of ac...
Brendan Tran Morris, Mohan M. Trivedi
IVC
2007
184views more  IVC 2007»
15 years 7 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
« Prev « First page 1668 / 2243 Last » Next »