Sciweavers

1670 search results - page 175 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
FAST
2004
15 years 4 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
151
Voted
LREC
2008
180views Education» more  LREC 2008»
15 years 4 months ago
Do we Still Need Gold Standards for Evaluation?
The availability of a huge mass of textual data in electronic format has increased the need for fast and accurate techniques for textual data processing. Machine learning and stat...
Thierry Poibeau, Cédric Messiant
138
Voted
ICDE
2006
IEEE
239views Database» more  ICDE 2006»
15 years 9 months ago
Grid Representation for Efficient Similarity Search in Time Series Databases
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
Guifang Duan, Yu Suzuki, Kyoji Kawagoe
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
16 years 3 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
DATAMINE
2008
137views more  DATAMINE 2008»
15 years 3 months ago
Two heads better than one: pattern discovery in time-evolving multi-aspect data
Abstract. Data stream values are often associated with multiple aspects. For example, each value observed at a given time-stamp from environmental sensors may have an associated ty...
Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke,...