4007 search results - page 376 / 802 » Computation with imprecise probabilities |
202
Voted
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
225
Voted
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
196
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper presents a novel approach to single-frame pedestrian classification and orientation estimation. Unlike previous work which addressed classification and orientation sepa...
167
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
159
Voted
BMVC
2001
15 years 9 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...