Sciweavers

3265 search results - page 100 / 653
» Representing Groups on Graphs
Sort
View
110
Voted
ICANN
2007
Springer
15 years 10 months ago
Recursive Principal Component Analysis of Graphs
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...
Alessio Micheli, Alessandro Sperduti
WAW
2004
Springer
80views Algorithms» more  WAW 2004»
15 years 9 months ago
Dominating Sets in Web Graphs
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
Colin Cooper, Ralf Klasing, Michele Zito
148
Voted
TPDS
2010
109views more  TPDS 2010»
15 years 2 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
161
Voted
CIVR
2008
Springer
239views Image Analysis» more  CIVR 2008»
15 years 5 months ago
Analyzing Flickr groups
There is an explosion of community-generated multimedia content available online. In particular, Flickr constitutes a 200-million photo sharing system where users participate foll...
Radu Andrei Negoescu, Daniel Gatica-Perez
119
Voted
HICSS
1998
IEEE
111views Biometrics» more  HICSS 1998»
15 years 8 months ago
Measuring Disagreement in Groups Facing Limited Choice Problems
Agreement is an important concept in group interaction, both for computermediated and face-to-face groups. This paper presents a measure of disagreement, D, for groups facing limi...
Brian Whitworth, Roy Felton