16666 search results - page 2672 / 3334 » Descriptive and Computational Complexity |
224
Voted
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
207
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
272
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Testing and debugging database system applications is often challenging and time consuming. A database tester (or DB tester for short) has to detect a problem, determine why it ha...
307
Voted
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
279
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...