Sciweavers

56 search results - page 6 / 12
» Learning a Fast Emulator of a Binary Decision Process
Sort
View
ECML
2007
Springer
13 years 9 months ago
Sequence Labeling with Reinforcement Learning and Ranking Algorithms
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
Francis Maes, Ludovic Denoyer, Patrick Gallinari
EMNLP
2010
13 years 5 months ago
Hashing-Based Approaches to Spelling Correction of Personal Names
We propose two hashing-based solutions to the problem of fast and effective personal names spelling correction in People Search applications. The key idea behind our methods is to...
Raghavendra Udupa, Shaishav Kumar
ICDAR
2007
IEEE
14 years 1 months ago
Fast Lexicon-Based Scene Text Recognition with Sparse Belief Propagation
Using a lexicon can often improve character recognition under challenging conditions, such as poor image quality or unusual fonts. We propose a flexible probabilistic model for c...
Jerod J. Weinman, Erik G. Learned-Miller, Allen R....
DAC
1999
ACM
13 years 11 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
ICDM
2009
IEEE
142views Data Mining» more  ICDM 2009»
13 years 5 months ago
Building Classifiers with Independency Constraints
In this paper we study the problem of classifier learning where the input data contains unjustified dependencies between some data attributes and the class label. Such cases arise...
Toon Calders, Faisal Kamiran, Mykola Pechenizkiy