247 search results - page 7 / 50 » On Finding Large Conjunctive Clusters |
NIPS
2001
13 years 9 months ago
2001
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
RT
2000
Springer
13 years 11 months ago
2000
Springer
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
JUCS
2002
13 years 7 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
GECCO
2003
Springer
14 years 23 days ago
2003
Springer
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
OSDI
2004
ACM
14 years 7 months ago
2004
ACM
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...