7 search results - page 1 / 2 » Linearly Bounded Reformulations of Conjunctive Databases |
CL
2000
Springer
13 years 10 months ago
2000
Springer
SARA
2000
Springer
13 years 9 months ago
2000
Springer
4OR
2006
13 years 5 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
ICDT
2001
ACM
13 years 10 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...