Sciweavers

16218 search results - page 3018 / 3244
» Standards
Sort
View
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 8 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
FPL
2008
Springer
153views Hardware» more  FPL 2008»
15 years 8 months ago
Exploring FPGA network on chip implementations across various application and network loads
Abstract-The network on chip will become a future general purpose interconnect for FPGAs much like today's standard OPB or PLB bus architectures. However, performance characte...
Graham Schelle, Dirk Grunwald
ISLPED
2007
ACM
109views Hardware» more  ISLPED 2007»
15 years 8 months ago
A multi-model power estimation engine for accuracy optimization
RTL power macromodeling is a mature research topic with a variety of equation and table-based approaches. Despite its maturity, macromodeling is not yet widely accepted as an indu...
Felipe Klein, Guido Araujo, Rodolfo Azevedo, Rober...
ACL
2008
15 years 8 months ago
A Critical Reassessment of Evaluation Baselines for Speech Summarization
We assess the current state of the art in speech summarization, by comparing a typical summarizer on two different domains: lecture data and the SWITCHBOARD corpus. Our results ca...
Gerald Penn, Xiaodan Zhu
« Prev « First page 3018 / 3244 Last » Next »