463 search results - page 35 / 93 » The lattice dimension of a graph |
ICCAD
2000
IEEE
15 years 2 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
CGO
2004
IEEE
15 years 1 months ago
2004
IEEE
Traditionally, software pipelining is applied either to the innermost loop of a given loop nest or from the innermost loop to outer loops. In this paper, we propose a threestep ap...
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
We address the connection between the multiple-description (MD) problem and Delta-Sigma quantization. The inherent redundancy due to oversampling in Delta-Sigma quantization, and ...
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...
IFIP12
2007
14 years 11 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...