871 search results - page 74 / 175 » The vertex-cover polynomial of a graph |
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
PPAM
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
UAI
2004
14 years 11 months ago
2004
This paper concerns the assessment of the effects of actions from a combination of nonexperimental data and causal assumptions encoded in the form of a directed acyclic graph in w...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
DAM
2008
14 years 10 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...