Sciweavers

82 search results - page 4 / 17
» Reasoning about online algorithms with weighted automata
Sort
View
FSTTCS
2006
Springer
14 years 6 days ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
CVPR
2007
IEEE
14 years 10 months ago
Online Learning Asymmetric Boosted Classifiers for Object Detection
We present an integrated framework for learning asymmetric boosted classifiers and online learning to address the problem of online learning asymmetric boosted classifiers, which ...
Minh-Tri Pham, Tat-Jen Cham
COLT
2007
Springer
14 years 2 months ago
Learning Permutations with Exponential Weights
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
David P. Helmbold, Manfred K. Warmuth
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
13 years 10 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
Shawn O'Neil, Amitabh Chaudhary
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
14 years 1 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker