5675 search results - page 133 / 1135 » Exploiting Chaos for Computation |
147
click to vote
ICS
2005
Tsinghua U.
15 years 10 months ago
2005
Tsinghua U.
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimension...
136
click to vote
PPL
2008
15 years 4 months ago
2008
The aim of this work is to introduce a computational costs system associated to a semantic framework for orthogonal data and control parallelism handling. In such a framework a pa...
130
click to vote
COMGEO
2000
ACM
15 years 4 months ago
2000
ACM
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this work we present a prototype for simulating computer network attacks. Our objective is to simulate large networks (thousands of hosts, with applications and vulnerabilities)...
CSDA
2006
15 years 4 months ago
2006
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...