1147 search results - page 50 / 230 » Statistical Timing Analysis Using Bounds |
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
Human activity analysis is an important problem in computer
vision with applications in surveillance and summarization
and indexing of consumer content. Complex human
activities...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...