1688 search results - page 39 / 338 » The Complexity of Rationalizing Matchings |
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
Palmprint is a unique and reliable biometric characteristic with high usability. With the increasing demand of automatic palmprint authentication systems, the development of accur...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
We propose a new complexity modeling framework for multimedia tasks. We characterize the traffic with five parameters that together we designate as a task's complexity specif...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...