Sciweavers

557 search results - page 54 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
83
Voted
SAC
2009
ACM
15 years 6 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
ICPR
2010
IEEE
14 years 9 months ago
Learning Scene Semantics Using Fiedler Embedding
We propose a framework to learn scene semantics from surveillance videos. Using the learnt scene semantics, a video analyst can efficiently and effectively retrieve the hidden sem...
Jingen Liu, Saad Ali
CIVR
2005
Springer
133views Image Analysis» more  CIVR 2005»
15 years 4 months ago
Hot Event Detection and Summarization by Graph Modeling and Matching
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
Yuxin Peng, Chong-Wah Ngo
93
Voted
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 11 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
ECCC
2006
70views more  ECCC 2006»
14 years 11 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas