2370 search results - page 77 / 474 » The Characterization of Data-Accumulating Algorithms |
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...
104
click to vote
IVC
2007
14 years 11 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
AI
1998
Springer
14 years 11 months ago
1998
Springer
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
STOC
2003
ACM
16 years 4 days ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
ICCAD
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...