4797 search results - page 355 / 960 » The complexity of partition tasks |
199
click to vote
PADS
2003
ACM
16 years 25 days ago
2003
ACM
There is a wide-spread usage of hardware design languages(HDL) to speed up the time-to-market for the design of modern digital systems. Verification engineers can simulate hardwa...
209
click to vote
EUROPAR
2003
Springer
16 years 24 days ago
2003
Springer
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
210
click to vote
IMR
2003
Springer
16 years 23 days ago
2003
Springer
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
174
click to vote
DATE
2002
IEEE
16 years 16 days ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...
212
click to vote
COMPGEOM
2009
ACM
16 years 7 days ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....