Sciweavers

1977 search results - page 61 / 396
» The satisfactory partition problem
Sort
View
ASPDAC
1999
ACM
122views Hardware» more  ASPDAC 1999»
15 years 10 months ago
A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
Shiuann-Shiuh Lin, Wen-Hsin Chen, Wen-Wei Lin, Tin...
JCO
2006
96views more  JCO 2006»
15 years 6 months ago
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang...
PVLDB
2010
123views more  PVLDB 2010»
15 years 4 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...
MCS
2001
Springer
15 years 10 months ago
Finding Consistent Clusters in Data Partitions
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
Ana L. N. Fred
VC
2008
172views more  VC 2008»
15 years 5 months ago
Consistent mesh partitioning and skeletonisation using the shape diameter function
Abstract Mesh partitioning and skeletonisation are fundamental for many computer graphics and animation techniques. Because of the close link between an object's skeleton and ...
Lior Shapira, Ariel Shamir, Daniel Cohen-Or