Sciweavers

1538 search results - page 21 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
AIPR
2005
IEEE
14 years 2 months ago
Hyperspectral Detection Algorithms: Operational, Next Generation, on the Horizon
Abstract—The multi-band target detection algorithms implemented in hyperspectral imaging systems represent perhaps the most successful example of image fusion. A core suite of su...
A. Schaum
IPMU
2010
Springer
13 years 11 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
WWW
2004
ACM
14 years 9 months ago
The webgraph framework I: compression techniques
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
Paolo Boldi, Sebastiano Vigna
ICASSP
2011
IEEE
13 years 21 days ago
Improved model-based spectral compressive sensing via nested least squares
This paper introduces a new algorithm for reconstructing signals with sparse spectrums from noisy compressive measurements. The proposed model-based algorithm takes the signal str...
Mahdi Shaghaghi, Sergiy A. Vorobyov
WCE
2007
13 years 10 months ago
A Comparative Analysis of Image Fusion Techniques for Remote Sensed Images
—This paper deals with different techniques for registration and fusion of remote sensed images. In this work the lower spatial resolution multispectral and higher resolution pan...
Asha Das, K. Revathy