Sciweavers

4208 search results - page 564 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
BMCBI
2005
112views more  BMCBI 2005»
15 years 2 months ago
Visualization methods for statistical analysis of microarray clusters
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
Matthew A. Hibbs, Nathaniel C. Dirksen, Kai Li, Ol...
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
14 years 5 months ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 3 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
16 years 3 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
SENSYS
2004
ACM
15 years 8 months ago
Medians and beyond: new aggregation techniques for sensor networks
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divya...