86 search results - page 15 / 18 » Polynomial Constraints for Sets with Cardinality Bounds |
175
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
100
click to vote
PODS
1997
ACM
15 years 3 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
112
Voted
COMGEO
2008
ACM
14 years 11 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
LICS
2002
IEEE
15 years 4 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...