12 search results - page 1 / 3 » Classification of small (0, 2)-graphs |
JCT
2006
13 years 4 months ago
2006
We find the graphs of valency at most 7 with the property that any two nonadjacent vertices have either 0 or 2 common neighbours. In particular, we find all semibiplanes of block ...
NETWORKS
2002
13 years 4 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
SIAMCO
2000
13 years 4 months ago
2000
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...
INTERSPEECH
2010
12 years 11 months ago
2010
Ratings of voices' likability were collected in two successive studies. A single scale seems to be sufficient for assessing such ratings. Based on limited but controlled data...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...