Sciweavers

5608 search results - page 283 / 1122
» On the Theory of Matchgate Computations
Sort
View
IJCV
2000
82views more  IJCV 2000»
15 years 6 months ago
Linear Differential Algorithm for Motion Recovery: A Geometric Approach
The aim of this paper is to explore a linear geometric algorithm for recovering the three dimensional motion of a moving camera from image velocities. Generic similarities and diff...
Yi Ma, Jana Kosecka, Shankar Sastry
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
MSCS
2000
126views more  MSCS 2000»
15 years 6 months ago
Sequent combinators: a Hilbert system for the lambda calculus
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...
Healfdene Goguen, Jean Goubault-Larrecq
TIT
1998
139views more  TIT 1998»
15 years 6 months ago
Codes for Digital Recorders
—Constrained codes are a key component in the digital recording devices that have become ubiquitous in computer data storage and electronic entertainment applications. This paper...
Kees A. Schouhamer Immink, Paul H. Siegel, Jack K....
TCS
2002
15 years 6 months ago
Martin's game: a lower bound for the number of sets
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
M. Ageev