1866 search results - page 104 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
156
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...
128
click to vote
CRYPTO
2009
Springer
16 years 19 days ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
152
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
164
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
140
click to vote
FOCM
2002
15 years 5 months ago
2002
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...