Sciweavers

1396 search results - page 62 / 280
» Succinct Dynamic Data Structures
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
CORR
2010
Springer
183views Education» more  CORR 2010»
14 years 12 months ago
Discovering shared and individual latent structure in multiple time series
This paper proposes a nonparametric Bayesian method for exploratory data analysis and feature construction in continuous time series. Our method focuses on understanding shared fe...
Suchi Saria, Daphne Koller, Anna Penn
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 5 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
VLDB
1997
ACM
165views Database» more  VLDB 1997»
15 years 5 months ago
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural...
Roy Goldman, Jennifer Widom
CSDA
2007
100views more  CSDA 2007»
15 years 1 months ago
Estimation of fractional integration in the presence of data noise
The paper presents a comparative study on the performance of commonly used estimators of the fractional order of integration when data is contaminated by noise. In particular, meas...
Niels Haldrup, Morten Ørregaard Nielsen