Sciweavers

9818 search results - page 356 / 1964
» Much Support and More
Sort
View
ICALP
2010
Springer
15 years 8 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
LREC
2008
120views Education» more  LREC 2008»
15 years 8 months ago
Exploiting the Role of Position Feature in Chinese Relation Extraction
Relation extraction is the task of finding pre-defined semantic relations between two entities or entity mentions from text. Many methods, such as feature-based and kernel-based m...
Peng Zhang, Wenjie Li, Furu Wei, Qin Lu, Yuexian H...
FLAIRS
2004
15 years 8 months ago
A Faster Algorithm for Generalized Multiple-Instance Learning
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
Qingping Tao, Stephen D. Scott
WSC
2001
15 years 8 months ago
Using quantile estimates in simulating internet queues with Pareto service times
It is readily apparent how important the Internet is to modern life. The exponential growth in its use requires good tools for analyzing congestion. Much has been written recently...
Martin J. Fischer, Denise M. Bevilacqua Masi, Dona...
NAACL
2003
15 years 8 months ago
Supervised and unsupervised PCFG adaptation to novel domains
This paper investigates adapting a lexicalized probabilistic context-free grammar (PCFG) to a novel domain, using maximum a posteriori (MAP) estimation. The MAP framework is gener...
Brian Roark, Michiel Bacchiani