Sciweavers

1823 search results - page 240 / 365
» Distributed lossy averaging
Sort
View
CF
2005
ACM
15 years 7 months ago
An efficient wakeup design for energy reduction in high-performance superscalar processors
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...
Kuo-Su Hsiao, Chung-Ho Chen
CONEXT
2005
ACM
15 years 7 months ago
MRS: a simple cross-layer heuristic to improve throughput capacity in wireless mesh networks
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
Luigi Iannone, Serge Fdida
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 7 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
PDPTA
2004
15 years 7 months ago
On the Use of NSGrid for Accurate Grid Schedule Evaluation
Abstract Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly comp...
Bruno Volckaert, Pieter Thysebaert, Marc De Leenhe...
NIPS
2003
15 years 7 months ago
AUC Optimization vs. Error Rate Minimization
The area under an ROC curve (AUC) is a criterion used in many applications to measure the quality of a classification algorithm. However, the objective function optimized in most...
Corinna Cortes, Mehryar Mohri