667 search results - page 68 / 134 » Exceptions for Algorithmic Skeletons |
ICIC
2007
Springer
14 years 2 months ago
2007
Springer
Whether constant π (i.e., pi) is normal is a confusing problem without any strict theoretical demonstration except for some statistical proof. A new concept of pi series is introd...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We present an algorithm to compute a Delaunay mesh conforming to a polyhedron possibly with small input angles. The radius-edge ratio of most output tetrahedra are bounded by a co...
FUN
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. A man walks into a men’s room and observes n empty urinals. Which urinal should he pick so as to maximize his chances of maintaining privacy, i.e., minimize the chance ...
COCO
2001
Springer
14 years 1 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...