9532 search results - page 1675 / 1907 » Logic, Graphs, and Algorithms |
177
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
162
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
254
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Many kinds of real-life data exhibit logical ordering among their data items and are thus sequential in nature. However, traditional online analytical processing (OLAP) systems an...
184
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
156
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we propose a novel client-side, multi-granularity caching scheme, called "Complementary Space Caching" (CS caching), for location-based services in mobile ...