Sciweavers

1092 search results - page 196 / 219
» Abbreviated text input using language modeling
Sort
View
ANLP
1994
108views more  ANLP 1994»
13 years 11 months ago
Does Baum-Welch Re-estimation Help Taggers?
In part of speech tagging by Hidden Markov Model, a statistical model is used to assign grammatical categories to words in a text. Early work in the field relied on a corpus which...
David Elworthy
PPPJ
2009
ACM
14 years 4 months ago
Automatic parallelization for graphics processing units
Accelerated graphics cards, or Graphics Processing Units (GPUs), have become ubiquitous in recent years. On the right kinds of problems, GPUs greatly surpass CPUs in terms of raw ...
Alan Leung, Ondrej Lhoták, Ghulam Lashari
SAT
2004
Springer
106views Hardware» more  SAT 2004»
14 years 3 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
ECML
1998
Springer
14 years 1 months ago
Predicate Invention and Learning from Positive Examples Only
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
Henrik Boström
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 12 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou