Sciweavers

1523 search results - page 45 / 305
» The Computational Complexity of Linear Optics
Sort
View
SIGGRAPH
2010
ACM
13 years 11 months ago
A synthetic-vision based steering approach for crowd simulation
In the everyday exercise of controlling their locomotion, humans rely on their optic flow of the perceived environment to achieve collision-free navigation. In crowds, in spite o...
Jan Ondrej, Julien Pettré, Anne-Hélène Olivier,...
ACCV
2010
Springer
13 years 3 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
ICPR
2008
IEEE
14 years 3 months ago
Linear representation of discrete surfaces in 3D
A method to compute a linear medial representation of a complex surface in the 3D discrete space is presented. The method involves voxel classification, surface labeling, anchor p...
Carlo Arcelli, Gabriella Sanniti di Baja, Luca Ser...
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
14 years 1 months ago
On the Complexity of Matsui's Attack
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 243 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 243 DES evalua...
Pascal Junod
ICML
2007
IEEE
14 years 9 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal