13603 search results - page 226 / 2721 » On the Complexity of Computing Treelength |
135
click to vote
ACCV
2007
Springer
15 years 12 months ago
2007
Springer
This paper proposes a novel method of estimating 3-D hand posture from images observed in complex backgrounds. Conventional methods often cause mistakes by mis-matches of local ima...
128
click to vote
CRYPTO
2007
Springer
15 years 12 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
134
click to vote
STACS
2007
Springer
15 years 12 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
168
click to vote
IMR
1998
Springer
15 years 10 months ago
1998
Springer
High reynolds number ow simulations exhibit strong gradients normal to walls and across shear layers requiring much ner resolution of the solution in some directions compared to o...
149
click to vote
FOCS
1990
IEEE
15 years 9 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...