74 search results - page 1 / 15 » Towards definitive benchmarking of algorithm performance |
ECIS
2003
13 years 6 months ago
2003
One of the primary methods employed by researchers to judge the merits of new heuristics and algorithms is to run them on accepted benchmark test cases and comparing their perform...
ICSAP
2010
13 years 8 months ago
2010
The environment in which video motion needs to be tracked, places several constraints on the design of the tracking system. Current datasets which are used to evaluate and compare...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
ICIP
2002
IEEE
14 years 6 months ago
2002
IEEE
A significant effort has been put in designing watermarking algorithms during the last decade. But today, the watermarking community needs some advanced attacks and fair benchmark...