We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
Recent work [5, 6] showed that learning-based patch
rectification methods are both faster and more reliable than
affine region methods. Unfortunately, their performance improveme...
Stefan Hinterstoisser, Oliver Kutter, Nassir Navab...
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
In this report we present a robust method to recover 3D position and orientation (pose) of a moving head using a single stationary camera. Head pose is recovered by formulating th...