Sciweavers

1650 search results - page 229 / 330
» The HOM problem is decidable
Sort
View
SDM
2010
SIAM
144views Data Mining» more  SDM 2010»
15 years 7 months ago
A Probabilistic Framework to Learn from Multiple Annotators with Time-Varying Accuracy
This paper addresses the challenging problem of learning from multiple annotators whose labeling accuracy (reliability) differs and varies over time. We propose a framework based ...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
NIPS
2004
15 years 7 months ago
Heuristics for Ordering Cue Search in Decision Making
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
Peter M. Todd, Anja Dieckmann
AI
2007
Springer
15 years 6 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
WWW
2003
ACM
16 years 7 months ago
Monitoring the dynamic web to respond to continuous queries
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
Sandeep Pandey, Krithi Ramamritham, Soumen Chakrab...
ISBRA
2009
Springer
16 years 1 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...