Sciweavers

1538 search results - page 22 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
14 years 1 months ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen
IEICET
2010
92views more  IEICET 2010»
13 years 7 months ago
Spectral Methods for Thesaurus Construction
Traditionally, popular synonym acquisition methods are based on the distributional hypothesis, and a metric such as Jaccard coefficients is used to evaluate the similarity between...
Nobuyuki Shimizu, Masashi Sugiyama, Hiroshi Nakaga...
JEA
2010
95views more  JEA 2010»
13 years 7 months ago
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
Reinhard Bauer, Daniel Delling, Peter Sanders, Den...
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
13 years 7 months ago
Maximum likelihood mapping with spectral image registration
Abstract— A core challenge in probabilistic mapping is to extract meaningful uncertainty information from data registration methods. While this has been investigated in ICP-based...
Max Pfingsthorn, Andreas Birk 0002, Sören Sch...
ICC
2009
IEEE
157views Communications» more  ICC 2009»
14 years 3 months ago
A Graph Approach to Dynamic Fractional Frequency Reuse (FFR) in Multi-Cell OFDMA Networks
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
Ronald Chang, Zhifeng Tao, Jinyun Zhang, C.-C. Jay...