Sciweavers

2652 search results - page 81 / 531
» Privacy-preserving linear programming
Sort
View
FLOPS
2004
Springer
15 years 5 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
OL
2010
87views more  OL 2010»
14 years 10 months ago
Uniqueness of integer solution of linear equations
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...
O. L. Mangasarian, Michael C. Ferris
IGPL
2000
99views more  IGPL 2000»
14 years 11 months ago
Linear Explicit Substitutions
Abstract Neil Ghani Valeria de Paiva Eike Ritter The -calculus 1 adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implement...
Neil Ghani, Valeria de Paiva, Eike Ritter
CP
2005
Springer
15 years 1 months ago
A Linear-Logic Semantics for Constraint Handling Rules
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
Hariolf Betz, Thom W. Frühwirth
EOR
2011
106views more  EOR 2011»
14 years 3 months ago
Probability of unique integer solution to a system of linear equations
We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer:...
O. L. Mangasarian, Benjamin Recht