5115 search results - page 775 / 1023 » On Randomized Lanczos Algorithms |
150
click to vote
ICBA
2004
Springer
15 years 11 months ago
2004
Springer
The open set recognition task, most challenging among the biometric tasks, operates under the assumption that not all the probes have mates in the gallery. It requires the availabi...
158
click to vote
KDD
2004
ACM
15 years 11 months ago
2004
ACM
Detection of space-time clusters is an important function in various domains (e.g., epidemiology and public health). The pioneering work on the spatial scan statistic is often use...
159
click to vote
SAS
2004
Springer
15 years 11 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
189
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
185
click to vote
ICDM
2003
IEEE
2003
IEEE
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
15 years 11 months ago
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...