21324 search results - page 405 / 4265 » Making the case for computing |
169
click to vote
CAGD
2010
15 years 3 months ago
2010
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
322
click to vote
Publication
Popular myths that cheaper memory, high-speed links and high-speed processors will solve the problem of congestion in computer networks are shown to be false. A simple definition f...
179
click to vote
ARITH
2009
IEEE
16 years 25 days ago
2009
IEEE
The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately ...
178
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
142
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We discuss a number of fundamental areas in which biologically inspired computing has so far failed to mirror biological reality. These failures make it difficult for those who st...