Sciweavers

1242 search results - page 190 / 249
» The Theory of Grammar Constraints
Sort
View
SIGSOFT
2005
ACM
16 years 1 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
186
Voted
ICDT
2009
ACM
198views Database» more  ICDT 2009»
16 years 1 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
124
Voted
WWW
2008
ACM
16 years 1 months ago
First workshop on targeting and ranking for online advertising
Online advertising is a rapidly growing, multi-billion dollar industry. It has become a significant element of the Web browsing experience. Ad platforms used for ad selection use ...
Ewa Dominowska, Vanja Josifovski
WWW
2007
ACM
16 years 1 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 1 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy