2366 search results - page 202 / 474 » Mapping time |
174
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
113
click to vote
SMA
1999
ACM
15 years 8 months ago
1999
ACM
Many solid modeling construction techniques produce non-manifold r-sets (solids). With each non-manifold model N we can associate a family of manifold solid models that are infini...
136
click to vote
NCA
2008
IEEE
15 years 4 months ago
2008
IEEE
The conventional channel-optimized vector quantization (COVQ) is very powerful in the protection of vector quantization (VQ) data over noisy channels. However, it suffers from the ...
159
click to vote
CPHYSICS
2011
14 years 7 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
127
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping an...