Sciweavers

1024 search results - page 126 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 3 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
TACAS
2009
Springer
101views Algorithms» more  TACAS 2009»
14 years 3 months ago
Parametric Trace Slicing and Monitoring
Analysis of execution traces plays a fundamental role in many program analysis approaches. Execution traces are frequently parametric, i.e., they contain events with parameter bind...
Feng Chen, Grigore Rosu
CVPR
2010
IEEE
14 years 5 months ago
Unsupervised Learning of Invariant Features Using Video
We present an algorithm that learns invariant features from real data in an entirely unsupervised fashion. The principal benefit of our method is that it can be applied without hu...
David Stavens, Sebastian Thrun
ISCAS
2008
IEEE
136views Hardware» more  ISCAS 2008»
14 years 3 months ago
Spatial-temporal consistent labeling for multi-camera multi-object surveillance systems
Abstract—For an intelligent multi-camera multi-object surveillance system, object correspondence across time and space is important to many smart visual applications. In this pap...
Jing-Ying Chang, Tzu-Heng Wang, Shao-Yi Chien, Lia...
RTSS
1998
IEEE
14 years 1 months ago
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan