Sciweavers

1051 search results - page 136 / 211
» An algorithm for the principal component analysis of large d...
Sort
View
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 12 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 8 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
BMCBI
2006
151views more  BMCBI 2006»
13 years 8 months ago
Modeling Sage data with a truncated gamma-Poisson model
Background: Serial Analysis of Gene Expressions (SAGE) produces gene expression measurements on a discrete scale, due to the finite number of molecules in the sample. This means t...
Helene H. Thygesen, Aeilko H. Zwinderman
ESANN
2000
13 years 9 months ago
Distributed clustering and local regression for knowledge discovery in multiple spatial databases
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
Aleksandar Lazarevic, Dragoljub Pokrajac, Zoran Ob...
NIPS
1998
13 years 9 months ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller