1538 search results - page 48 / 308 » Spectral Techniques in Graph Algorithms |
PDP
2006
IEEE
14 years 4 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...
DAC
1995
ACM
14 years 1 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 ...
IGARSS
2010
13 years 8 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...
COLT
2008
Springer
13 years 12 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...
CHI
2010
ACM
14 years 5 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 ...