Sciweavers

AAAI
2012
11 years 7 months ago
Adaptive Polling for Information Aggregation
The flourishing of online labor markets such as Amazon Mechanical Turk (MTurk) makes it easy to recruit many workers for solving small tasks. We study whether information elicita...
Thomas Pfeiffer, Xi Alice Gao, Yiling Chen, Andrew...
AIPS
2010
13 years 3 months ago
Genome Rearrangement and Planning: Revisited
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that ch...
Tansel Uras, Esra Erdem
TREC
2004
13 years 6 months ago
Columbia University in the Novelty Track at TREC 2004
Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text sp...
Barry Schiffman, Kathleen McKeown
AAAI
2010
13 years 6 months ago
Genome Rearrangement: A Planning Approach
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that cha...
Tansel Uras, Esra Erdem
ICML
2004
IEEE
13 years 10 months ago
Redundant feature elimination for multi-class problems
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
Annalisa Appice, Michelangelo Ceci, Simon Rawles, ...
IPPS
2005
IEEE
13 years 10 months ago
High-Performance Direct Pairwise Comparison of Large Genomic Sequences
Many applications in Comparative Genomics lend themselves to implementations that take advantage of common high-performance features in modern microprocessors. However, the common...
Christopher Mueller, Mehmet M. Dalkilic, Andrew Lu...