Sciweavers

507 search results - page 63 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
DICTA
2009
13 years 8 months ago
Dense Correspondence Extraction in Difficult Uncalibrated Scenarios
Abstract--The relationship between multiple cameras viewing the same scene may be discovered automatically by finding corresponding points in the two views and then solving for the...
Ruan Lakemond, Clinton Fookes, Sridha Sridharan
ACCV
2010
Springer
13 years 2 months ago
An Efficient RANSAC for 3D Object Recognition in Noisy and Occluded Scenes
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
Chavdar Papazov, Darius Burschka
ISVC
2009
Springer
14 years 2 months ago
Exploiting Mutual Camera Visibility in Multi-camera Motion Estimation
Abstract. This paper addresses the estimation of camera motion and 3D reconstruction from image sequences for multiple independently moving cameras. If multiple moving cameras reco...
Christian Kurz, Thorsten Thormählen, Bodo Ros...
ACNS
2010
Springer
189views Cryptology» more  ACNS 2010»
14 years 17 days ago
High Performance GHASH Function for Long Messages
Abstract. This work presents a new method to compute the GHASH function involved in the Galois/Counter Mode of operation for block ciphers. If X = X1 . . . Xn is a bit string made ...
Nicolas Meloni, Christophe Nègre, M. Anwar ...
BROADNETS
2004
IEEE
13 years 11 months ago
Diverse Routing for Shared Risk Resource Groups (SRRG) Failures in WDM Optical Networks
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
Pallab Datta, Arun K. Somani