1011 search results - page 19 / 203 » The three dimensions of proofs |
COMPGEOM
1996
ACM
15 years 1 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We use entropy rates and Schur concavity to prove that, for every integer k 2, every nonzero rational number q, and every real number , the base-k expansions of , q + , and q all...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
GD
2004
Springer
15 years 3 months ago
2004
Springer
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
DM
1999
14 years 9 months ago
1999
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...