969 search results - page 93 / 194 » Clustering performance data efficiently at massive scales |
AAAI
2010
15 years 2 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
115
Voted
BMCBI
2007
15 years 21 days ago
2007
Background: New high throughput pyrosequencers such as the 454 Life Sciences GS 20 are capable of massively parallelizing DNA sequencing providing an unprecedented rate of output ...
113
click to vote
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
119
Voted
ASPLOS
2009
ACM
15 years 4 months ago
2009
ACM
As our society becomes more information-driven, we have begun to amass data at an astounding and accelerating rate. At the same time, power concerns have made it difficult to brin...
117
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...