Sciweavers

201 search results - page 26 / 41
» On Computing Ad-hoc Selective Families
Sort
View
ACL
1996
13 years 8 months ago
Minimizing Manual Annotation Cost in Supervised Training from Corpora
Corpus-based methods for natural language processing often use supervised training, requiring expensive manual annotation of training corpora. This paper investigates methods for ...
Sean P. Engelson, Ido Dagan
LATA
2010
Springer
14 years 18 days ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau
DISOPT
2008
88views more  DISOPT 2008»
13 years 7 months ago
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
Renato Bruni, Andrea Santori
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 months ago
p53FamTaG: a database resource of human p53, p63 and p73 direct target genes combining in silico prediction and microarray data
Background: The p53 gene family consists of the three genes p53, p63 and p73, which have polyhedral non-overlapping functions in pivotal cellular processes such as DNA synthesis a...
Elisabetta Sbisà, Domenico Catalano, Giorgi...
IPPS
2000
IEEE
13 years 12 months ago
Speed vs. Accuracy in Simulation for I/O-Intensive Applications
This paper presents a family of simulators that have been developed for data-intensive applications, and a methodology to select the most efficient one based on a usersupplied req...
Hyeonsang Eom, Jeffrey K. Hollingsworth