JGT
2010
13 years 10 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
INFOCOM
1996
IEEE
14 years 4 months ago
1996
IEEE
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
ICC
2007
IEEE
14 years 6 months ago
2007
IEEE
— We examine the Shannon limits of communication systems when the precision of the analog-to-digital conversion (ADC) at the receiver is constrained. ADC is costly and powerhungr...
IWPEC
2009
Springer
14 years 6 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
WABI
2009
Springer
14 years 7 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
ICPP
2009
IEEE
14 years 7 months ago
2009
IEEE
—This paper investigates fundamental performance limits of medium access control (MAC) protocols for particular underwater multi-hop sensor networks under a fair-access criterion...
LATA
2009
Springer
14 years 7 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...