Sciweavers

1284 search results - page 145 / 257
» Data Structures for Mergeable Trees
Sort
View
IMC
2005
ACM
15 years 8 months ago
Exploiting Underlying Structure for Detailed Reconstruction of an Internet-scale Event
Network “telescopes” that record packets sent to unused blocks of Internet address space have emerged as an important tool for observing Internet-scale events such as the spre...
Abhishek Kumar, Vern Paxson, Nicholas Weaver
CVPR
2006
IEEE
16 years 4 months ago
Efficient Maximally Stable Extremal Region (MSER) Tracking
This paper introduces a tracking method for the well known local MSER (Maximally Stable Extremal Region) detector. The component tree is used as an efficient data structure, which...
Michael Donoser, Horst Bischof
GVD
2009
128views Database» more  GVD 2009»
15 years 6 days ago
A Self-Adaptive Insert Strategy for Content-Based Multidimensional Database Storage
In this paper, we present the current development progress of our dynamic insert strategy based on the Intelligent Cluster Index (ICIx), which is a new type of multidimensional da...
Sebastian Leuoth, Wolfgang Benn
AAAI
2008
15 years 4 months ago
Adapting ADtrees for High Arity Features
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...
Robert Van Dam, Irene Langkilde-Geary, Dan Ventura
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
15 years 3 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers