Sciweavers

4880 search results - page 504 / 976
» Manuals as Structured Programs
Sort
View
ORL
2011
15 years 2 months ago
Solving large Steiner Triple Covering Problems
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
230
Voted
JMLR
2012
13 years 9 months ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
Hossein Azari Soufiani, Edo Airoldi
POPL
2009
ACM
16 years 7 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
POPL
2009
ACM
16 years 7 months ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
ICFP
2007
ACM
16 years 7 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson