6274 search results - page 520 / 1255 » From query complexity to computational complexity |
172
click to vote
ICCV
2003
IEEE
16 years 9 days ago
2003
IEEE
The perception of transparent objects from images is known to be a very hard problem in vision. Given a single image, it is difficult to even detect the presence of transparent o...
250
click to vote
BMCBI
2011
15 years 2 months ago
2011
Background: The Cell Ontology (CL) is an ontology for the representation of in vivo cell types. As biological ontologies such as the CL grow in complexity, they become increasingl...
226
click to vote
IACR
2011
14 years 6 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
146
click to vote
ECCV
2002
Springer
16 years 9 months ago
2002
Springer
This paper studies the inference of 3D shape from a set of ? noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, ...
181
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...