1302 search results - page 65 / 261 » On the Strong Chromatic Number |
142
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require n(1) time per operation, unless 3SUM has strongly subquadratic alg...
163
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The downlink capacity of cellular networks is known to be strongly limited by inter-cell interference. In order to mitigate this interference, a number of frequency reuse scheme...
192
click to vote
LICS
1996
IEEE
15 years 10 months ago
1996
IEEE
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...
142
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
Thrashing in transactionprocessingsystemscan be prevented by controlling the number of concurrently running transactions. Becausethe optimal concurrency level strongly dependson t...
158
click to vote
AMW
2010
15 years 7 months ago
2010
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...