4865 search results - page 536 / 973 » The Complexity of Graph Connectivity |
207
click to vote
IWPEC
2004
Springer
16 years 13 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
186
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
195
click to vote
GCB
2009
Springer
15 years 11 months ago
2009
Springer
: Understanding complex biological systems requires data from manifold biological levels. Often this data is analysed in some meaningful context, for example, by integrating it int...
172
click to vote
AI
2005
Springer
15 years 7 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
160
click to vote
CAD
2002
Springer
15 years 6 months ago
2002
Springer
This paper presents a method for three-dimensional surface flattening, which can be efficiently used in threedimensional computer aided garment design. First, facet model is used ...