2219 search results - page 380 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
101
click to vote
PLDI
1999
ACM
15 years 6 months ago
1999
ACM
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
142
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
A novel method for crowd flow modeling and anomaly detection is proposed for both coherent and incoherent scenes. The novelty is revealed in three aspects. First, it is a unique ut...
163
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
133
Voted
MOBICOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
153
click to vote
POPL
2011
ACM
14 years 5 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...