1942 search results - page 295 / 389 » HINT: A new way to measure computer performance |
182
click to vote
APPROX
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
163
click to vote
RT
2004
Springer
15 years 11 months ago
2004
Springer
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...
147
click to vote
MICCAI
2002
Springer
16 years 7 months ago
2002
Springer
Characterizing the performance of image segmentation approaches has been a persistent challenge. Performance analysis is important since segmentation algorithms often have limited ...
199
click to vote
PAMI
2011
15 years 1 months ago
2011
— This paper addresses recognition of human actions under view changes. We explore self-similarities of action sequences over time and observe the striking stability of such meas...
179
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...