6142 search results - page 453 / 1229 » The Complexity of Partition Functions |
173
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
198
click to vote
LCPC
1997
Springer
15 years 11 months ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
181
click to vote
COMPGEOM
1993
ACM
15 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
168
click to vote
CIKM
1994
Springer
15 years 11 months ago
1994
Springer
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
191
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...