709 search results - page 97 / 142 » In-stroke word completion |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
CSSC
2008
14 years 12 months ago
2008
This paper examines a weighted version of the quantile regression estimator defined by Koenker and Bassett (1978), adjusted to the case of nonlinear longitudinal data. Different w...
DM
2008
14 years 12 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
ENDM
2008
14 years 12 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...