Sciweavers

480 search results - page 76 / 96
» connection 2002
Sort
View
DM
2002
95views more  DM 2002»
13 years 7 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...
ENTCS
2002
77views more  ENTCS 2002»
13 years 7 months ago
Trivial Reals
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
FMSD
2002
81views more  FMSD 2002»
13 years 7 months ago
A Notation and Logic for Mobile Computing
Abstract. We de ne a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pat...
Gruia-Catalin Roman, Peter J. McCann
IGPL
2002
91views more  IGPL 2002»
13 years 7 months ago
The Unrestricted Combination of Temporal Logic Systems
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
Marcelo Finger, M. Angela Weiss
IJCV
2002
157views more  IJCV 2002»
13 years 7 months ago
Dense Features for Semi-Dense Stereo Correspondence
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler