Sciweavers

141 search results - page 18 / 29
» Partitioning Approach to Visualization of Large Graphs
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 27 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
CP
2009
Springer
14 years 8 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
ICML
2009
IEEE
14 years 8 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis
GD
1995
Springer
13 years 11 months ago
Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
M. Sheelagh T. Carpendale, David J. Cowperthwaite,...
ICASSP
2010
IEEE
13 years 7 months ago
Graph based event detection from realistic videos using weak feature correspondence
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
Lei Ding, Quanfu Fan, Jen-Hao Hsiao, Sharath Panka...