1538 search results - page 14 / 308 » Spectral Techniques in Graph Algorithms |
109
Voted
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
110
click to vote
WICON
2008
15 years 1 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
ICML
2007
IEEE
16 years 15 days ago
2007
IEEE
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
CONCUR
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...