1439 search results - page 182 / 288 » Fast approximation of centrality |
92
Voted
MICCAI
1999
Springer
15 years 5 months ago
1999
Springer
The “Demons Algorithm” in increasingly used for non-rigid registration of 3D medical images. However, if it is fast and usually accurate, the algorithm is based on intuitive id...
107
Voted
STACS
1999
Springer
15 years 5 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
145
click to vote
ARITH
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
FSE
2007
Springer
15 years 4 months ago
2007
Springer
The reflection attack is a recently discovered self similarity analysis which is usually mounted on ciphers with many fixed points. In this paper, we describe two reflection attack...
98
Voted
CIA
2006
Springer
15 years 4 months ago
2006
Springer
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...