Sciweavers

1538 search results - page 24 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ICIP
2010
IEEE
13 years 8 months ago
Local two-channel critically sampled filter-banks on graphs
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...
Sunil K. Narang, Antonio Ortega
ICIP
2007
IEEE
14 years 11 months ago
Automated Segmentation of Torn Frames using the Graph Cuts Technique
Film Tear is a form of degradation in archived film and is the physical ripping of the film material. Tear causes displacement of a region of the degraded frame and the loss of im...
David Corrigan, Naomi Harte, Anil C. Kokaram
CVIU
2008
113views more  CVIU 2008»
13 years 10 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
13 years 8 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
IWCMC
2010
ACM
14 years 3 months ago
Group detection in mobility traces
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
Yung-Chih Chen, Elisha J. Rosensweig, Jim Kurose, ...