Sciweavers

5138 search results - page 273 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ICAS
2009
IEEE
139views Robotics» more  ICAS 2009»
16 years 1 months ago
Predicting Web Server Crashes: A Case Study in Comparing Prediction Algorithms
Abstract—Traditionally, performance has been the most important metrics when evaluating a system. However, in the last decades industry and academia have been paying increasing a...
Javier Alonso, Jordi Torres, Ricard Gavaldà
FOCM
2010
140views more  FOCM 2010»
15 years 5 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
JPDC
2010
65views more  JPDC 2010»
15 years 5 months ago
Combining shared-coin algorithms
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
James Aspnes, Hagit Attiya, Keren Censor
CISS
2008
IEEE
16 years 1 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
INFOCOM
2007
IEEE
16 years 26 days ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano