19 search results - page 2 / 4 » The Ordinary Line Problem Revisited |
COCOON
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
ICTAC
2005
Springer
13 years 11 months ago
2005
Springer
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensu...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
VL
2006
IEEE
13 years 11 months ago
2006
IEEE
We have been working to uncover gender differences in the ways males and females problem solve in end-user programming situations, and have discovered differences in males’ vers...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...