828 search results - page 128 / 166 » Bounded Hairpin Completion |
EOR
2010
13 years 10 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
DM
2008
13 years 10 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
COR
2006
13 years 10 months ago
2006
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...
CN
2007
13 years 10 months ago
2007
This paper proposes a novel call admission control scheme capable of providing a combination of call and packet level quality of service requirements in cellular packet networks. ...
CN
2007
13 years 10 months ago
2007
Point-to-point delay is an important network performance measure as it captures service degradations caused by various events. We study how to measure and report delay in a concis...