Sciweavers

3044 search results - page 80 / 609
» Linear logical approximations
Sort
View
VLDB
2002
ACM
91views Database» more  VLDB 2002»
13 years 8 months ago
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
Arvind Hulgeri, S. Sudarshan
CSL
2007
Springer
14 years 3 months ago
Focusing and Polarization in Intuitionistic Logic
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
Chuck Liang, Dale Miller
INFORMS
1998
150views more  INFORMS 1998»
13 years 8 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
ICISC
2009
163views Cryptology» more  ICISC 2009»
13 years 6 months ago
Improved Linear Cryptanalysis of SOSEMANUK
The SOSEMANUK stream cipher is one of the finalists of the eSTREAM project. In this paper, we improve the linear cryptanalysis of SOSEMANUK presented in Asiacrypt 2008. We apply th...
Joo Yeon Cho, Miia Hermelin
LICS
1995
IEEE
14 years 13 days ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning