1942 search results - page 21 / 389 » HINT: A new way to measure computer performance |
CVIU
2008
15 years 1 months ago
2008
It is frequently remarked that designers of computer vision algorithms and systems cannot reliably predict how algorithms will respond to new problems. A variety of reasons have b...
CG
2000
Springer
15 years 6 months ago
2000
Springer
: We present a new algorithm for selective search by iterative expansion of leaf nodes. The algorithm reasons with leaf evaluations in a way that leads to high confidence in the c...
113
click to vote
ESCIENCE
2005
IEEE
15 years 7 months ago
2005
IEEE
Volunteer computing projects use a task server to manage work. Clients periodically communicate with the server to report completed tasks and get new tasks. The rate at which the ...
106
click to vote
GRID
2008
Springer
15 years 2 months ago
2008
Springer
For data analysis or simulations (e.g. in particle physics) single users submit hundreds or thousands of jobs to the Grid. This puts a new burden on the users side - keeping an ov...
101
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...