Sciweavers

20441 search results - page 68 / 4089
» Locally Computable Structures
Sort
View
IWPEC
2009
Springer
14 years 2 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke
LICS
2007
IEEE
14 years 2 months ago
Local Action and Abstract Separation Logic
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yan...
ECCV
2004
Springer
14 years 9 months ago
The Least-Squares Error for Structure from Infinitesimal Motion
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
John Oliensis
CVPR
2010
IEEE
14 years 1 months ago
Putting local features on a Manifold
Local features have proven very useful for recognition. Manifold learning has proven to be a very powerful tool in data analysis. However, manifold learning application for imag...
Marwan Torki and Ahmed Elgammal
CPAIOR
2004
Springer
14 years 1 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel