6365 search results - page 249 / 1273 » Fast Local Computation Algorithms |
196
click to vote
CASES
2003
ACM
15 years 11 months ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
184
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
146
click to vote
CAMP
2005
IEEE
16 years 4 days ago
2005
IEEE
— In this paper we describe a two step algorithm which localizes faces in 2D color images depicting a single face on a complex background. Given a single image, the algorithm rou...
182
click to vote
EWCBR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We show how case bases can be compiled into Decision Diagrams, which represent the cases with reduced redundancy. Numerous computations can be performed efficiently on th...
191
click to vote
ISVC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we propose a novel and fast method to localize and track needles during image-guided interventions. Our proposed method is comprised of framework of needle...