Sciweavers

292 search results - page 12 / 59
» A linearization of the Lambda-calculus and consequences
Sort
View
ICTCS
2003
Springer
15 years 11 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
ISCAS
1999
IEEE
121views Hardware» more  ISCAS 1999»
15 years 10 months ago
The linear time-varying approach applied to a first-order dynamic translinear filter
Dynamic translinear (DTL) circuits use the exponential inputoutput relation of the transistor as a primitive for the synthesis of electronic circuits. As a consequence the analysi...
F. C. M. Kuijstermans, F. M. Diepstraten, Wouter A...
ICCV
2003
IEEE
16 years 8 months ago
Linear Multi-View Reconstruction of Points, Lines, Planes and Cameras using a Reference Plane
This paper presents a new linear method for reconstructing simultaneously 3D features (points, lines and planes) and cameras from many perspective views by solving a single linear...
Carsten Rother
IWPEC
2004
Springer
15 years 11 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos
COLT
2008
Springer
15 years 7 months ago
On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
Shai Shalev-Shwartz, Yoram Singer