5592 search results - page 777 / 1119 » On Random Betweenness Constraints |
206
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
173
click to vote
RIDE
1997
IEEE
15 years 11 months ago
1997
IEEE
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...
180
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
159
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
188
click to vote
DAC
1989
ACM
15 years 11 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...