Sciweavers

2652 search results - page 82 / 531
» Privacy-preserving linear programming
Sort
View
RECOMB
2009
Springer
15 years 6 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...
AMAST
2008
Springer
15 years 1 months ago
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
David Cachera, Thomas P. Jensen, Arnaud Jobin, Pas...
COCO
2007
Springer
107views Algorithms» more  COCO 2007»
15 years 6 months ago
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
ICALP
2009
Springer
16 years 3 days ago
An Explicit Formula for the Free Exponential Modality of Linear Logic
Christine Tasson, Nicolas Tabareau, Paul-Andr&eacu...
ICLP
2010
Springer
15 years 3 months ago
Focused Proof Search for Linear Logic in the Calculus of Structures
The proof-theoretic approach to logic programming has benefited from the
Nicolas Guenot