2767 search results - page 345 / 554 » Universal Exponentiation Algorithm |
144
click to vote
SAGT
2010
Springer
15 years 21 days ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
234
Voted
Publication
"The level set method is popular in the numerical implementation of curve evolution, but its high computational cost is a bottleneck for real-time applications. In this report...
210
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
Research at the Computer Vision Laboratory at the University of Maryland has focussed on developing algorithms and systems that can look at humans and recognize their activities i...
117
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...