688 search results - page 94 / 138 » General Partitioning on Random Graphs |
119
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
132
Voted
NIPS
2004
15 years 1 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
192
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
104
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
SMA
2005
ACM
15 years 6 months ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...