4366 search results - page 69 / 874 » Learning and Smoothed Analysis |
141
Voted
ICVGIP
2004
15 years 5 months ago
2004
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
144
Voted
EMNLP
2010
15 years 1 months ago
2010
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
111
Voted
ICML
2001
IEEE
16 years 4 months ago
2001
IEEE
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...
122
Voted
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
112
Voted
CCS
2009
ACM
15 years 10 months ago
2009
ACM
We propose a framework for quantitative security analysis of machine learning methods. Key issus of this framework are a formal specification of the deployed learning model and a...