1060 search results - page 114 / 212 » On the Discovery of Random Trees |
162
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
We propose a fast approach to 3?D object detection and pose estimation that owes its robustness to a training phase during which the target object slowly moves with respect to the ...
174
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
With the discovery of new exploit techniques, new protection mechanisms are needed as well. Mitigations like DEP (Data Execution Prevention) or ASLR (Address Space Layout Randomiz...
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
With the discovery of new exploit techniques, novel protection mechanisms are needed as well. Mitigations like DEP (Data Execution Prevention) or ASLR (Address Space Layout Random...
164
click to vote
APPROX
2009
Springer
16 years 28 days ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...