23 search results - page 4 / 5 » Attention-Based Dynamic Visual Search Using Inner-Scene Simi... |
CIAC
1994
Springer
13 years 10 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
POPL
2011
ACM
12 years 9 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
IROS
2009
IEEE
14 years 27 days ago
2009
IEEE
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
PPOPP
2006
ACM
14 years 6 days ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...