Sciweavers

6142 search results - page 70 / 1229
» The Complexity of Partition Functions
Sort
View
EGH
2005
Springer
15 years 3 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche
COMPGEOM
2008
ACM
14 years 11 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
IWPT
2001
14 years 11 months ago
Automatic Grammar Partitioning for Syntactic Parsing
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
Po-Chui Luk, Fuliang Weng, Helen Meng
128
Voted
COMPLEXITY
2011
14 years 4 months ago
Generating signals with multiscale time irreversibility: The asymmetric weierstrass function
Anton Burykin, Madalena Costa, Chung-Kang Peng, Ar...