2555 search results - page 459 / 511 » Quantifiers and Working Memory |
190
click to vote
ICFP
2012
ACM
13 years 10 days ago
2012
ACM
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
156
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
CVPR
2008
IEEE
15 years 12 months ago
2008
IEEE
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...