20745 search results - page 141 / 4149 » Computer graphics for all |
SIBGRAPI
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...
IEICET
2008
15 years 1 months ago
2008
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...
107
click to vote
DCC
2006
IEEE
16 years 1 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
118
click to vote
ADCM
2007
15 years 1 months ago
2007
Given an arbitrary finite sequence of vectors in a finite–dimensional Hilbert space, we describe an algorithm, which computes a Parseval frame for the subspace generated by the...