6251 search results - page 982 / 1251 » Randomness, Computability, and Density |
184
Voted
GD
2009
Springer
15 years 12 months ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
202
click to vote
MIDDLEWARE
2009
Springer
15 years 12 months ago
2009
Springer
Today’s distributed systems need runtime error detection to catch errors arising from software bugs, hardware errors, or unexpected operating conditions. A prominent class of err...
205
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
216
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a compact random-access vector representation for solid textures made of intermixed regions with relatively smooth internal color variations. It is fea...
189
click to vote
ICN
2001
Springer
15 years 11 months ago
2001
Springer
—This paper presents a new scalable buffer-management scheme for IP Differentiated Services. The scheme consists of a Differentiated Random Drop (DRD) algorithm using feedback fr...