Sciweavers

372 search results - page 65 / 75
» A Study of The Fragile Base Class Problem
Sort
View
SOFSEM
2010
Springer
15 years 8 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
99
Voted
ICCV
2009
IEEE
1419views Computer Vision» more  ICCV 2009»
16 years 4 months ago
On Feature Combination for Multiclass Object Classification
A key ingredient in the design of visual object classification systems is the identification of relevant class specific aspects while being robust to intra-class variations. Whil...
Peter Gehler, Sebastian Nowozin
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 10 days ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
IANDC
2007
107views more  IANDC 2007»
14 years 11 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
PRL
2008
85views more  PRL 2008»
14 years 11 months ago
Reliability estimation of a statistical classifier
Pattern classification techniques derived from statistical principles have been widely studied and have proven powerful in addressing practical classification problems. In real-wo...
Pandu Ranga Rao Devarakota, Bruno Mirbach, Bjö...