Sciweavers

6142 search results - page 18 / 1229
» The Complexity of Partition Functions
Sort
View
JCO
2006
96views more  JCO 2006»
13 years 7 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...
EUROPAR
2009
Springer
14 years 1 days ago
Distributed Data Partitioning for Heterogeneous Processors Based on Partial Estimation of Their Functional Performance Models
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
Alexey L. Lastovetsky, Ravi Reddy
DCG
2006
82views more  DCG 2006»
13 years 7 months ago
Volume Computation for Polytopes and Partition Functions for Classical Root Systems
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we prese...
M. Welleda Baldoni-Silva, Matthias Beck, Charles C...
VC
2008
172views more  VC 2008»
13 years 7 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
ISSS
1997
IEEE
107views Hardware» more  ISSS 1997»
13 years 11 months ago
Port Calling: A Transformation for Reducing I/O during Multi-Package Functional Partitioning
Partitioning a system among multiple input and output pin I O limited packages is a widely researched and hard to solve problem. We previously described a new approach yielding ...
Frank Vahid