1120 search results - page 69 / 224 » Making computer science minority-friendly |
STACS
1999
Springer
15 years 4 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
CSE
2009
IEEE
15 years 6 months ago
2009
IEEE
—The stigmergy collaboration approach provides a hypothesized explanation about how online groups work together. In this research, we presented a stigmergy approach for building ...
CSE
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
ACMSE
2009
ACM
15 years 6 months ago
2009
ACM
Computer networks have grown considerably over the past decade. Faster and cheaper Internet connections have brought millions of PCs into a domain where rich content and fast down...