Sciweavers

173 search results - page 15 / 35
» A Framework for Proving Contract-Equipped Classes
Sort
View
DISOPT
2007
155views more  DISOPT 2007»
14 years 11 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 10 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
TSP
2011
151views more  TSP 2011»
14 years 6 months ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 2 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
ECOOP
2010
Springer
15 years 3 months ago
Verifying Executable Object-Oriented Specifications with Separation Logic
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
Stephan van Staden, Cristiano Calcagno, Bertrand M...