2314 search results - page 97 / 463 » Minimal Partitions of a Graph |
138
Voted
DOLAP
2004
ACM
15 years 9 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
134
Voted
INFOCOM
1999
IEEE
15 years 7 months ago
1999
IEEE
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
136
Voted
ICCD
1997
IEEE
15 years 7 months ago
1997
IEEE
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process. All previous work in parallel simulated annealing bas...
111
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
135
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...