1083 search results - page 52 / 217 » Efficient Discovery of Confounders in Large Data Sets |
161
click to vote
ISMB
2000
15 years 7 months ago
2000
We have developed a set of methods and tools for automatic discovery of putative regulatory signals in genome sequences. The analysis pipeline consists of gene expression data clu...
287
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
171
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
280
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
227
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...