15033 search results - page 304 / 3007 » Complexity Theory and Algorithms |
172
Voted
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
We present a new Coprime Blurred Pair (CBP) theory that may benefit a number of computer vision applications. A CBP is constructed by blurring the same latent image with two unkn...
154
Voted
FORTE
1997
15 years 6 months ago
1997
This paper presents a testing theory that is parameterised with assumptions about the way implementations communicate with their environment. In this way some existing testing the...
163
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
168
click to vote
ICPR
2002
IEEE
16 years 6 months ago
2002
IEEE
We present the theory behind a novel unsupervised method for discovering quasi-static objects, objects that are stationary during some interval of observation, within image sequen...
149
click to vote
MDM
2009
Springer
15 years 11 months ago
2009
Springer
Mobile Ad-hoc NETworks (MANETs) are known to be vulnerable to a variety of attacks due to lack of central authority or fixed network infrastructure. Many security schemes have bee...