Sciweavers

3690 search results - page 421 / 738
» Computation with classical sequents
Sort
View
ECCV
2010
Springer
16 years 4 days ago
Making Action Recognition Robust to Occlusions and Viewpoint Changes
Most state-of-the-art approaches to action recognition rely on global representations either by concatenating local information in a long descriptor vector or by computing a single...
ISCA
2003
IEEE
114views Hardware» more  ISCA 2003»
16 years 2 days ago
Building Quantum Wires: The Long and the Short of It
As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental com...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang, Jo...
CONCUR
2003
Springer
16 years 19 hour ago
Comparative Branching-Time Semantics
d Abstract) Christel Baier1 , Holger Hermanns2,3 , Joost-Pieter Katoen2 , and Verena Wolf1 1 Institut f¨ur Informatik I, University of Bonn R¨omerstraße 164, D-53117 Bonn, Germa...
Christel Baier, Holger Hermanns, Joost-Pieter Kato...
ECCV
2010
Springer
15 years 11 months ago
Multi-Person Tracking with Sparse Detection and Continuous Segmentation
This paper presents an integrated framework for mobile street-level tracking of multiple persons. In contrast to classic tracking-by-detection approaches, our framework employs an ...
FOCS
2002
IEEE
15 years 11 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich