2040 search results - page 341 / 408 » On the Complexity of Error Explanation |
139
click to vote
CHI
2011
ACM
14 years 8 months ago
2011
ACM
Nonparametric data from multi-factor experiments arise often in human-computer interaction (HCI). Examples may include error counts, Likert responses, and preference tallies. But ...
178
click to vote
AAAI
2011
14 years 4 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
141
click to vote
EMNLP
2011
14 years 4 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
160
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
165
Voted
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
Recovering 3D geometry from a single 2D line drawing is an important and challenging problem in computer vision. It has wide applications in interactive 3D modeling from images, c...