75 search results - page 6 / 15 » Definability of Combinatorial Functions and Their Linear Rec... |
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
ICIP
2001
IEEE
16 years 1 months ago
2001
IEEE
The use of higher-order local autocorrelations as features for pattern recognition has been acknowledged since many years, but their applicability was restricted to relatively low...
EDBT
2008
ACM
15 years 11 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
DM
2008
14 years 11 months ago
2008
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
APAL
2002
14 years 11 months ago
2002
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...