Sciweavers

1092 search results - page 205 / 219
» Abbreviated text input using language modeling
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 10 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
CP
2008
Springer
13 years 11 months ago
CPBPV: A Constraint-Programming Framework for Bounded Program Verification
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
Hélène Collavizza, Michel Rueher, Pa...
EMNLP
2010
13 years 7 months ago
What a Parser Can Learn from a Semantic Role Labeler and Vice Versa
In many NLP systems, there is a unidirectional flow of information in which a parser supplies input to a semantic role labeler. In this paper, we build a system that allows inform...
Stephen A. Boxwell, Dennis Mehay, Chris Brew
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
IEICET
2008
67views more  IEICET 2008»
13 years 10 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...