Sciweavers

1381 search results - page 164 / 277
» Structural signatures for tree data structures
Sort
View
AAAI
2008
15 years 6 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 5 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
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 11 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
BIRTHDAY
2008
Springer
15 years 5 months ago
A Heterogeneous Approach to UML Semantics
Abstract. UML models consist of several diagrams of different types describing different views of a software system ranging from specifications of the static system structure to de...
María Victoria Cengarle, Alexander Knapp, A...
TCOM
2010
162views more  TCOM 2010»
14 years 10 months ago
RFID Reader Receivers for Physical Layer Collision Recovery
Abstract--Arbitration and scheduling of multiple tags in stateof-the-art Radio Frequency Identification (RFID) systems is accomplished on the medium access control layer. Currently...
Christoph Angerer, Robert Langwieser, Markus Rupp