Sciweavers

209 search results - page 24 / 42
» The Computational Complexity of Weak Saddles
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 12 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 7 months ago
Communication and Round Efficient Information Checking Protocol
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
Arpita Patra, C. Pandu Rangan
CVPR
2009
IEEE
15 years 2 months ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
Active learning strategies can be useful when manual labeling effort is scarce, as they select the most informative examples to be annotated first. However, for visual category ...
Sudheendra Vijayanarasimhan (University of Texas a...
ICPR
2008
IEEE
14 years 2 months ago
Grading nuclear pleomorphism on histological micrographs
A mainstay in cancer diagnostics is the classification or grading of cell nuclei based on their appearance. While the analysis of cytological samples has been automated successful...
Eric Cosatto, Matthew Miller, Hans Peter Graf, Joh...
KRDB
2003
111views Database» more  KRDB 2003»
13 years 9 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis