2200 search results - page 84 / 440 » Bloch's Constant is Computable |
CIE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
106
click to vote
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
COMPGEOM
2004
ACM
15 years 3 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...
LCN
2002
IEEE
15 years 2 months ago
2002
IEEE
Wireless channels usually face bursty errors, i.e., errors are prone to occur in clusters. These bit errors can be modeled using the Gilbert-Elliott model. When data packets are t...
WG
2001
Springer
15 years 2 months ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...