468 search results - page 56 / 94 » One-Way Functions in Complexity Theory |
153
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
120
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
121
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
135
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
119
Voted
ISPDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...