684 search results - page 47 / 137 » A characterization of b-perfect graphs |
ACCV
2010
Springer
14 years 9 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
129
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
94
Voted
CN
2000
15 years 1 months ago
2000
The study of the web as a graph is not only fascinating in its own right, but also yields valuable insight into web algorithms for crawling, searching and community discovery, and...
96
Voted
COMBINATORICS
2000
15 years 1 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
ICNC
2005
Springer
15 years 7 months ago
2005
Springer
Fingertip pulsations (plethysmograms) were found to obey chaotic dynamics [1]. We applied chaos theory to analysis of the time series of plethysmograms under various human physio-p...