Sciweavers

123 search results - page 21 / 25
» A New Point Access Method Based on Wavelet Trees
Sort
View
MHCI
2005
Springer
14 years 1 months ago
Rolling, rotating and imagining in a virtual mobile world
New mobile devices can be difficult to use because they give users access to powerful computing devices through small interfaces, which typically have limited input facilities. On...
Lynne Baillie, Harald Kunczier, Hermann Anegg
IR
2008
13 years 7 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 7 months ago
Similarity Search on Time Series Based on Threshold Queries
Similarity search in time series data is required in many application fields. The most prominent work has focused on similarity search considering either complete time series or si...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...
ENTCS
2007
168views more  ENTCS 2007»
13 years 7 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
14 years 9 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...