Sciweavers

1078 search results - page 190 / 216
» Analyzing DB2 Data Sharing Performance Problems
Sort
View
KDD
2007
ACM
156views Data Mining» more  KDD 2007»
14 years 9 months ago
Estimating rates of rare events at multiple resolutions
We consider the problem of estimating occurrence rates of rare events for extremely sparse data, using pre-existing hierarchies to perform inference at multiple resolutions. In pa...
Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrab...
IDA
2009
Springer
13 years 6 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
14 years 2 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
VLDB
1999
ACM
145views Database» more  VLDB 1999»
14 years 1 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
BMCBI
2010
121views more  BMCBI 2010»
13 years 6 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...