1221 search results - page 40 / 245 » Balanced graph partitioning |
EJC
2008
13 years 9 months ago
2008
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
DOLAP
1998
ACM
14 years 1 months ago
1998
ACM
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
SC
2003
ACM
14 years 2 months ago
2003
ACM
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
AAAI
2004
13 years 10 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...