5316 search results - page 182 / 1064 » Which Search Problems Are Random |
174
Voted
CVPR
2011
IEEE
15 years 12 hour ago
2011
IEEE
Fast and reliable algorithms for estimating the head pose are essential for many applications and higher-level face analysis tasks. We address the problem of head pose estimation ...
159
Voted
IPL
2000
15 years 3 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
146
Voted
EMO
2003
Springer
15 years 9 months ago
2003
Springer
This paper introduces an interface specification (PISA) that allows to separate the problem-specific part of an optimizer from the problem-independent part. We propose a view of ...
145
Voted
PKC
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
190
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...