848 search results - page 15 / 170 » Randomness and the linear degrees of computability |
91
Voted
TPDS
2010
14 years 10 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
111
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Bad weather, such as fog and haze, can significantly degrade the visibility of a scene. Optically, this is due to the substantial presence of particles in the atmosphere that abso...
ISIPTA
2003
IEEE
15 years 5 months ago
2003
IEEE
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...
GD
2006
Springer
15 years 3 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
ISSAC
2005
Springer
15 years 5 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...