3008 search results - page 502 / 602 » Independence in connected graphs |
187
click to vote
AAAI
1996
15 years 7 months ago
1996
We describe a framework for robot navigation that exploits the continuity of image sequences. Tracked visual features both guide the robot and provide predictive information about...
179
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
163
click to vote
AMC
2006
15 years 6 months ago
2006
A new methodology for the reliability evaluation of an l-dissimilar-unit non-repairable cold-standby redundant system is introduced in this paper. Each unit is composed of a numbe...
192
click to vote
FTTCS
2006
15 years 6 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
172
click to vote
IPL
2008
15 years 6 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...