Sciweavers

403 search results - page 43 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
ISMIR
2001
Springer
262views Music» more  ISMIR 2001»
14 years 2 months ago
Automated Rhythm Transcription
We present a technique that, given a sequence of musical note onset times, performs simultaneous identi cation of the notated rhythm and the variable tempo associated with the tim...
Christopher Raphael
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
14 years 3 months ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
Salil P. Vadhan
QUESTA
2007
117views more  QUESTA 2007»
13 years 9 months ago
Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, appli...
Sandeep Juneja
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
13 years 11 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
KDD
2010
ACM
287views Data Mining» more  KDD 2010»
13 years 12 months ago
Designing efficient cascaded classifiers: tradeoff between accuracy and cost
We propose a method to train a cascade of classifiers by simultaneously optimizing all its stages. The approach relies on the idea of optimizing soft cascades. In particular, inst...
Vikas C. Raykar, Balaji Krishnapuram, Shipeng Yu