Sciweavers

3238 search results - page 32 / 648
» Not Enough Points Is Enough
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
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...
Nader H. Bshouty, Philip M. Long
ICC
2007
IEEE
186views Communications» more  ICC 2007»
14 years 2 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– 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. ...
CVPR
2009
IEEE
15 years 10 days ago
Real-Time Learning of Accurate Patch Rectification
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...
CVPR
2005
IEEE
14 years 9 months ago
Randomized Trees for Real-Time Keypoint Recognition
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...
Vincent Lepetit, Pascal Lagger, Pascal Fua
ICPR
2006
IEEE
14 years 8 months ago
Robust 3D Head Tracking Using Camera Pose Estimation
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...
Ehud Rivlin, Shay Ohayon