74 search results - page 9 / 15 » A note on the size of minimal covers |
FPGA
1997
ACM
15 years 1 months ago
1997
ACM
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
TOG
2002
14 years 9 months ago
2002
We present a multi-scale algorithm for mapping a texture defined by an input image onto an arbitrary surface. It avoids the generation and storage of a new, specific texture. The ...
JCO
2008
14 years 9 months ago
2008
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
COCO
2004
Springer
15 years 1 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...