Sciweavers

575 search results - page 29 / 115
» A Spectral Approach to Lower Bounds
Sort
View
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
13 years 7 months ago
AVF Stressmark: Towards an Automated Methodology for Bounding the Worst-Case Vulnerability to Soft Errors
Soft error reliability is increasingly becoming a first-order design concern for microprocessors, as a result of higher transistor counts, shrinking device geometries and lowering ...
Arun A. Nair, Lizy Kurian John, Lieven Eeckhout
COLT
2010
Springer
13 years 7 months ago
Learning Rotations with Little Regret
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
DAGSTUHL
2004
13 years 11 months ago
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
William I. Gasarch, Frank Stephan
AMC
2006
173views more  AMC 2006»
13 years 9 months ago
Data envelopment analysis with missing values: An interval DEA approach
Missing values in inputs, outputs cannot be handled by the original data envelopment analysis (DEA) models. In this paper we introduce an approach based on interval DEA that allow...
Yannis G. Smirlis, Elias K. Maragos, Dimitris K. D...
RTSS
2005
IEEE
14 years 3 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson