192 search results - page 10 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
152
Voted
SIGMOD
2008
ACM
16 years 8 months ago
2008
ACM
Virtual machine monitors are becoming popular tools for the deployment of database management systems and other enterprise software applications. In this paper, we consider a commo...
82
Voted
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
79
Voted
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we present an innovative approach to automatically generate adjacency grammars describing graphical symbols. A grammar production is formulated in terms of rulesets ...
139
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...