2555 search results - page 459 / 511 » Quantifiers and Working Memory |
277
Voted
ICFP
2012
ACM
13 years 5 months 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...
206
Voted
PODS
2009
ACM
16 years 3 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...
135
click to vote
CVPR
2008
IEEE
16 years 4 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...
125
click to vote
ECCV
2006
Springer
16 years 4 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-...
116
click to vote
ECCV
2002
Springer
16 years 4 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...