1289 search results - page 41 / 258 » On the Minimal Embedding Field |
DAC
2000
ACM
14 years 9 months ago
2000
ACM
The idea of Force-Directed Scheduling (FDS) was first introduced by Paulin and Knight to minimize the number of resources required in the high-level synthesis of high-throughput A...
SAC
2003
ACM
14 years 1 months ago
2003
ACM
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...
SIGGRAPH
2010
ACM
13 years 11 months ago
2010
ACM
This paper proposes a new method for remeshing a surface into anisotropically sized quads. The basic idea is to construct a special standing wave on the surface to generate the gl...
ALGORITHMICA
2002
13 years 8 months ago
2002
This paper answers the following question: Given an \erector set" linkage, a connected set of xed-length links, what is the minimal needed to adjust the edge lengths so that ...
COMBINATORICS
2002
13 years 8 months ago
2002
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...