ESA
1999
Springer
14 years 3 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...
ESA
1999
Springer
14 years 3 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
IWCC
1999
IEEE
14 years 3 months ago
1999
IEEE
In this paper, we present techniques and algorithms to improve the performance of various communication patterns on message-passing platforms where, for reasons of safety, user-le...
IV
1999
IEEE
14 years 3 months ago
1999
IEEE
The aim of occlusion culling is to cull away a significant amount of invisible primitives at different viewpoints. We present two algorithms to improve occlusion culling for a hig...
COLT
1999
Springer
14 years 4 months ago
1999
Springer
In this paper we analyze the PAC learning abilities of several simple iterative algorithms for learning linear threshold functions, obtaining both positive and negative results. W...
COCO
1999
Springer
14 years 4 months ago
1999
Springer
COCO
1999
Springer
14 years 4 months ago
1999
Springer
COCO
1999
Springer
14 years 4 months ago
1999
Springer
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
COCO
1999
Springer
14 years 4 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
IPPS
1999
IEEE
14 years 4 months ago
1999
IEEE
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping an...