213 search results - page 16 / 43 » The randomized complexity of initial value problems |
EWC
2007
14 years 9 months ago
2007
This paper describes and exercises a new design paradigm for cast components. The methodology integrates foundry process simulation, non-destructive evaluation (nde), stress analys...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
110
click to vote
TSP
2010
14 years 4 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
OPODIS
2004
14 years 11 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...