Sciweavers

809 search results - page 144 / 162
» Answer Formulation for Question-Answering
Sort
View
136
Voted
ICIP
2009
IEEE
15 years 11 days ago
Informative sensing of natural images
The theory of compressed sensing tells a dramatic story that sparse signals can be reconstructed near-perfectly from a small number of random measurements. However, recent work ha...
Hyun Sung Chang, Yair Weiss, William T. Freeman
220
Voted
CVPR
2011
IEEE
14 years 6 months ago
Adaptive Random Forest - How many ``experts'' to ask before making a decision?
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
Alexander Schwing, Christopher Zach, Yefeng Zheng,...
108
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Geometric programming for aggregation of binary classifiers
Multiclass classification problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final...
Sunho Park, Seungjin Choi
136
Voted
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 2 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
104
Voted
ALT
2009
Springer
15 years 11 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee