2503 search results - page 259 / 501 » A study of 3-arc graphs |
167
click to vote
JITECH
2010
15 years 4 months ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
131
click to vote
SIAMDM
2010
15 years 4 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
167
click to vote
SSIRI
2010
15 years 4 months ago
2010
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
134
click to vote
SSS
2010
Springer
15 years 4 months ago
2010
Springer
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
203
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...