Sciweavers

1167 search results - page 116 / 234
» Limits of Spectral Clustering
Sort
View
CCR
2002
98views more  CCR 2002»
15 years 6 months ago
Efficient flooding with Passive Clustering (PC) in ad hoc networks
An ad hoc network is a fast deployable selfconfiguring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Node...
Taek Jin Kwon, Mario Gerla
ICANN
2007
Springer
16 years 1 months ago
Split-Merge Incremental LEarning (SMILE) of Mixture Models
In this article we present an incremental method for building a mixture model. Given the desired number of clusters K ≥ 2, we start with a two-component mixture and we optimize t...
Konstantinos Blekas, Isaac E. Lagaris
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 7 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
SASP
2009
IEEE
170views Hardware» more  SASP 2009»
16 years 1 months ago
Parade: A versatile parallel architecture for accelerating pulse train clustering
— In this paper, we present Parade, a novel and flexible parallel architecture for the deinterleaving of combined pulsetrains. This is a commonly performed task in various areas ...
Amin Ansari, Dan Zhang, Scott A. Mahlke
INTENSIVE
2009
IEEE
16 years 1 months ago
A Service for Data-Intensive Computations on Virtual Clusters
Digital Preservation deals with the long-term storage, access, and maintenance of digital data objects. In order to prevent a loss of information, digital libraries and archives a...
Rainer Schmidt, Christian Sadilek, Ross King