1538 search results - page 78 / 308 » Spectral Techniques in Graph Algorithms |
129
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
102
click to vote
VISSYM
2007
15 years 3 months ago
2007
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
118
click to vote
CC
2006
Springer
15 years 5 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
106
click to vote
SIES
2007
IEEE
15 years 7 months ago
2007
IEEE
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
124
click to vote
ECCV
2004
Springer
16 years 3 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...