433 search results - page 61 / 87 » Generalized Ham-Sandwich Cuts |
STOC
2005
ACM
14 years 3 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
STACS
1991
Springer
14 years 1 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
IPCO
2004
13 years 11 months ago
2004
In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these ine...
IJCAI
2003
13 years 11 months ago
2003
We present a coherent framework for data clustering. Starting with a Hopfield network, we show the solutions for several well-motivated clustering objective functions are principa...