2747 search results - page 182 / 550 » Non-oblivious Strategy Improvement |
141
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper the problem of off-line handwritten cursive text recognition is considered. A method for expanding the set of available training textlines by applying random perturb...
182
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
169
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper we focus on the adaptation of boosting to grammatical inference. We aim at improving the performances of state merging algorithms in the presence of noisy data by us...
169
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
141
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the following problem: A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). Some of the data is leaked and found in an un...