2693 search results - page 81 / 539 » On Computing Complex Navigation Functions |
148
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
138
Voted
ICFP
2007
ACM
16 years 2 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
131
click to vote
STACS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
131
click to vote
CIE
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization...
108
click to vote
SIBGRAPI
2006
IEEE
15 years 8 months ago
2006
IEEE
FingerCode is a fingerprint correlation matching scheme that relies on texture information. In this scheme, the oriented components are extracted from a fingerprint image using a ...