Sciweavers

6181 search results - page 473 / 1237
» Transactional Cluster Computing
Sort
View
ICPR
2004
IEEE
16 years 8 months ago
A Hierarchical Projection Pursuit Clustering Algorithm
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
Alexei D. Miasnikov, Jayson E. Rome, Robert M. Har...
RECOMB
2005
Springer
16 years 7 months ago
Individual Gene Cluster Statistics in Noisy Maps
Abstract. Identification of homologous chromosomal regions is important for understanding evolutionary processes that shape genome evolution, such as genome rearrangements and larg...
Narayanan Raghupathy, Dannie Durand
OSDI
2004
ACM
16 years 7 months ago
MapReduce: Simplified Data Processing on Large Clusters
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...
Jeffrey Dean, Sanjay Ghemawat
EUROSYS
2010
ACM
16 years 4 months ago
Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
Matei Zaharia, Dhruba Borthakur, Joydeep Sen Sarma...
AINA
2009
IEEE
16 years 1 months ago
Medium Access Control in Large Scale Clusters for Wireless Sensor Networks
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...