4 search results - page 1 / 1 » Local two-channel critically sampled filter-banks on graphs |
ICIP
2010
IEEE
13 years 5 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...
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
ICCAD
2007
IEEE
14 years 3 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...