Sciweavers

2496 search results - page 138 / 500
» On covering by translates of a set
Sort
View
CPP
2011
98views more  CPP 2011»
14 years 6 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach
CIKM
2008
Springer
15 years 8 months ago
Multi-aspect expertise matching for review assignment
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Maryam Karimzadehgan, ChengXiang Zhai, Geneva G. B...

Book
357views
17 years 4 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
FOCS
2008
IEEE
16 years 29 days ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
CSFW
2005
IEEE
16 years 3 days ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov