Sciweavers

4865 search results - page 827 / 973
» The Complexity of Graph Connectivity
Sort
View
FUIN
2000
71views more  FUIN 2000»
14 years 10 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
INFSOF
2000
91views more  INFSOF 2000»
14 years 9 months ago
An operational approach to the design of workflow systems
We construct models as an aid to our thought process. A particular class of models, operational models, can be used for simulation and prototyping. The Opj modeling language is su...
Rakesh Agarwal, Giorgio Bruno, Marco Torchiano
IJCV
2002
157views more  IJCV 2002»
14 years 9 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
IGPL
1998
97views more  IGPL 1998»
14 years 9 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
MOC
1998
92views more  MOC 1998»
14 years 9 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...