Sciweavers

191 search results - page 26 / 39
» Machine Reading
Sort
View
121
Voted
SOFSEM
2007
Springer
15 years 6 months ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean
97
Voted
FLAIRS
2007
15 years 2 months ago
Lexicon Development and POS Tagging Using a Tagged Bengali News Corpus
Lexicon development and Part of Speech (POS) tagging are very important for almost all Natural Language Processing(NLP) application areas. The rapid development of these resources...
Asif Ekbal, Sivaji Bandyopadhyay
133
Voted
BMCBI
2008
214views more  BMCBI 2008»
15 years 18 days ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
86
Voted
IJFCS
2007
105views more  IJFCS 2007»
15 years 12 days ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
112
Voted
RAS
2007
132views more  RAS 2007»
14 years 12 months ago
Virtual sensors for human concepts - Building detection by an outdoor mobile robot
Abstract— In human-robot communication it is often important to relate robot sensor readings to concepts used by humans. We suggest to use a virtual sensor (one or several physic...
Martin Persson, Tom Duckett, Achim J. Lilienthal