Sciweavers

522 search results - page 98 / 105
» Increasing Informativeness in Temporal Annotation
Sort
View
LPAR
2001
Springer
13 years 11 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 9 months ago
Active learning for biomedical citation screening
Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe ...
Byron C. Wallace, Kevin Small, Carla E. Brodley, T...
DLS
2008
149views Languages» more  DLS 2008»
13 years 8 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
BIOCOMP
2007
13 years 8 months ago
xMAN: extreme MApping of oligoNucleotides
Background: The ability to rapidly map millions of oligonucleotide fragments to a reference genome is crucial to many high throughput genomic technologies. Results: We propose an ...
Wei Li, Jason S. Carroll, Myles Brown, X. Shirley ...
AAMAS
2008
Springer
13 years 7 months ago
Using quantitative models to search for appropriate organizational designs
As the scale and scope of distributed and multi-agent systems grow, it becomes increasingly important to design and manage the participants' interactions. The potential for b...
Bryan Horling, Victor R. Lesser