Sciweavers

87 search results - page 10 / 18
» Limits of dense graph sequences
Sort
View
89
Voted
CORR
2008
Springer
112views Education» more  CORR 2008»
14 years 9 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
FOCS
2003
IEEE
15 years 2 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
71
Voted
ICCV
1999
IEEE
15 years 1 months ago
Camera Calibration and the Search for Infinity
This paper considers the problem of self-calibration of a camera from an image sequence in the case where the camera's internal parameters (most notably focal length) may cha...
Richard I. Hartley, Lourdes de Agapito, Ian D. Rei...
SCIA
2009
Springer
132views Image Analysis» more  SCIA 2009»
15 years 4 months ago
Instant Action Recognition
In this paper, we present an efficient system for action recognition from very short sequences. For action recognition typically appearance and/or motion information of an action ...
Thomas Mauthner, Peter M. Roth, Horst Bischof
ICPR
2008
IEEE
15 years 4 months ago
Embedding HMM's-based models in a Euclidean space: The topological hidden Markov models
One of the major limitations of HMM-based models is the inability to cope with topology: When applied to a visible observation (VO) sequence, HMM-based techniques have difficulty ...
Djamel Bouchaffra