| Publication | Date of Publication | Type |
|---|
Simplification of forest classifiers and regressors by sharing branching conditions
Machine Learning | 2025-12-04 | Paper |
Query learning algorithm for ordered multi-terminal binary decision diagrams
Discrete Applied Mathematics | 2024-05-06 | Paper |
Learning sparse linear combinations of basis functions over a finite domain
Lecture Notes in Computer Science | 2023-12-08 | Paper |
Graph minors from simulated annealing for annealing machines with sparse connectivity
Theory and Practice of Natural Computing | 2023-10-16 | Paper |
A bad arm existence checking problem: how to utilize asymmetric problem structure?
Machine Learning | 2020-03-04 | Paper |
Mistake bounds on the noise-free multi-armed bandit game
Information and Computation | 2019-12-18 | Paper |
Good arm identification via bandit feedback
Machine Learning | 2019-06-26 | Paper |
An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem
Operations Research Letters | 2018-09-28 | Paper |
Noise free multi-armed bandit game
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Mining approximate patterns with frequent locally optimal occurrences
Discrete Applied Mathematics | 2016-01-21 | Paper |
Fast algorithms for finding a minimum repetition representation of strings and trees
Discrete Applied Mathematics | 2014-04-16 | Paper |
Average-case linear-time similar substring searching by the q-gram distance
Theoretical Computer Science | 2014-03-27 | Paper |
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
Information Processing Letters | 2013-03-28 | Paper |
| scientific article; zbMATH DE number 5957295 (Why is no real title available?) | 2011-10-12 | Paper |
Algorithms for adversarial bandit problems with multiple plays
Lecture Notes in Computer Science | 2010-10-01 | Paper |
Query learning of bounded-width OBDDs
Lecture Notes in Computer Science | 2010-04-27 | Paper |
Learning-Related Complexity of Linear Ranking Functions
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Improvements to the linear programming based scheduling of web advertisements
Electronic Commerce Research | 2005-11-16 | Paper |
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation | 2005-10-10 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Online learning of binary and \(n\)-ary relations over clustered domains.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Query learning of bounded-width OBDDs
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1351104 (Why is no real title available?) | 1999-10-20 | Paper |
Exact learning of linear combinations of monotone terms from function value queries
Theoretical Computer Science | 1997-09-29 | Paper |
