Sciweavers

Share
211 search results - page 2 / 43
» A Half-Million Strong at Least
Sort
View
ARSCOM
2008
65views more  ARSCOM 2008»
9 years 10 months ago
Strongly pan-factorial property in cages
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least number of vertices. In this note, we show that (k; g)-cage has an r-factor of girt...
Guizhen Liu, Qinglin Yu
COMBINATORICA
2008
78views more  COMBINATORICA 2008»
9 years 10 months ago
Optimal strong parity edge-coloring of complete graphs
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...
David P. Bunde, Kevin Milans, Douglas B. West, Heh...
INFOCOM
2003
IEEE
10 years 3 months ago
Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
Predrag R. Jelenkovic, Ana Radovanovic
CPC
2007
76views more  CPC 2007»
9 years 10 months ago
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
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...
Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Pet...
ICASSP
2011
IEEE
9 years 2 months ago
The asymptotic properties of polynomial phase estimation by least squares phase unwrapping
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...
Robby G. McKilliam, I. Vaughan L. Clarkson, Barry ...
books