1362 search results - page 145 / 273 » Means, Correlations and Bounds |
189
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
169
click to vote
GLVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
175
click to vote
PODS
1997
ACM
15 years 10 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...
203
click to vote
CONCUR
1997
Springer
15 years 10 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
183
click to vote
INFOCOM
1996
IEEE
15 years 10 months ago
1996
IEEE
: We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model ...