Sciweavers

298 search results - page 5 / 60
» Simplicity in Solving the Frame Problem
Sort
View
EUROCRYPT
2004
Springer
14 years 1 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron
EAAI
2008
104views more  EAAI 2008»
13 years 7 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
CVPR
2011
IEEE
12 years 11 months ago
A Novel Parametrization of the Perspective-Three-Point Problem for a Direct Computation of Absolute Camera Position and Orientat
The Perspective-Three-Point (P3P) problem aims at determining the position and orientation of the camera in the world reference frame from three 2D-3D point correspondences. This ...
Laurent Kneip, Davide Scaramuzza, Roland Siegwart
ICDAR
2003
IEEE
14 years 29 days ago
Caption Text Recognition in Video Frames by MAP Matching
In this paper, an approach to detection of caption text in video frames is described. Text recognition in video can be applied to various applications, however there are still pro...
Akira Nakamura, Kazuhiko Yamamoto
JEC
2006
73views more  JEC 2006»
13 years 7 months ago
Frame packing algorithms for automotive applications
The set of frames exchanged in automotive applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandw...
Rishi Saket, Nicolas Navet