1538 search results - page 48 / 308 » Spectral Techniques in Graph Algorithms |
123
click to vote
PDP
2006
IEEE
15 years 7 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
103
click to vote
DAC
1995
ACM
15 years 4 months ago
1995
ACM
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
121
click to vote
IGARSS
2010
14 years 11 months ago
2010
Endmember extraction is an important technique in the context of spectral unmixing of remotely sensed hyperspectral data. Winter's N-FINDR algorithm is one of the most widely...
110
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
105
click to vote
CHI
2010
ACM
15 years 8 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...