1538 search results - page 31 / 308 » Spectral Techniques in Graph Algorithms |
IGARSS
2009
13 years 7 months ago
2009
Finding an accurate sparse approximation of a spectral vector described by a linear model, when there is available a library of possible constituent signals (called endmembers or ...
CVPR
2005
IEEE
15 years 2 days ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
BMCBI
2010
13 years 10 months ago
2010
Background: Recent biological discoveries have shown that clustering large datasets is essential for better understanding biology in many areas. Spectral clustering in particular ...
BMCBI
2007
13 years 10 months ago
2007
Background: In the last decade, techniques were established for the large scale genome-wide analysis of proteins, RNA, and metabolites, and database solutions have been developed ...
CAISE
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...