3757 search results - page 38 / 752 » The overlap number of a graph |
ISSRE
2008
IEEE
15 years 6 months ago
2008
IEEE
Project managers use inspection data as input to capture-recapture (CR) models to estimate the total number of faults present in a software artifact. The CR models use the number ...
107
click to vote
WACV
2005
IEEE
15 years 5 months ago
2005
IEEE
We present an approach for persistent tracking of moving objects observed by non-overlapping and moving cameras. Our approach robustly recovers the geometry of non-overlapping vie...
DM
2008
14 years 12 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
117
click to vote
JGT
2010
14 years 10 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
JSYML
2008
14 years 12 months ago
2008
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...