Sciweavers

337 search results - page 46 / 68
» Question Answering System for Incomplete and Noisy Data
Sort
View
APBC
2003
116views Bioinformatics» more  APBC 2003»
15 years 3 months ago
An Empirical Comparison of Supervised Machine Learning Techniques in Bioinformatics
Research in bioinformatics is driven by the experimental data. Current biological databases are populated by vast amounts of experimental data. Machine learning has been widely ap...
Aik Choon Tan, David Gilbert
HIPC
2007
Springer
15 years 5 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
127
Voted
DOCENG
2005
ACM
15 years 3 months ago
Integrating translation services within a structured editor
Fully automatic machine translation cannot produce high quality translation; Dialog-Based Machine Translation (DBMT) is the only way to provide authors with a means of translating...
Ali Choumane, Hervé Blanchon, Cécile...
NAACL
2007
15 years 3 months ago
Unsupervised Natural Language Processing Using Graph Models
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
Chris Biemann
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 1 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri