Sciweavers

258 search results - page 26 / 52
» Connections between Relation Algebras and Cylindric Algebras
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 3 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 11 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
LPNMR
1990
Springer
15 years 3 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
ACCV
2010
Springer
14 years 6 months ago
Planar Affine Rectification from Change of Scale
A method for affine rectification of a plane exploiting knowledge of relative scale changes is presented. The rectifying transformation is fully specified by the relative scale cha...
Ondrej Chum, Jiri Matas
CVPR
2001
IEEE
16 years 1 months ago
Combining Two-view Constraints For Motion Estimation
In this paper we describe two methods for estimating the motion parameters of an image sequence. For a sequence of images, the global motion can be described by ???? independent m...
Venu Madhav Govindu