204 search results - page 2 / 41 » A Half-Million Strong at Least |
COMBINATORICA
2008
14 years 9 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
CPC
2007
14 years 9 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
For most MR imaging applications multiple surface coils are used to obtain images with high signal-to-noise ratios (SNR). However, signal intensity strongly diminishes with distan...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Estimating the coefficients of a noisy polynomial phase signal is important in many fields including radar, biology and radio communications. One approach to estimation attempts...