Sciweavers

620 search results - page 70 / 124
» The edge-flipping group of a graph
Sort
View
KDD
2010
ACM
327views Data Mining» more  KDD 2010»
14 years 23 days ago
Cold start link prediction
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
Vincent Leroy, Berkant Barla Cambazoglu, Francesco...
ASUNAM
2010
IEEE
13 years 10 months ago
Tracking the Evolution of Communities in Dynamic Social Networks
Real-world social networks from a variety of domains can naturally be modelled as dynamic graphs. However, approaches to detecting communities have largely focused on identifying ...
Derek Greene, Dónal Doyle, Padraig Cunningh...
STAIRS
2008
143views Education» more  STAIRS 2008»
13 years 10 months ago
Domain-Dependent View of Multiple Robots Path Planning
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
Pavel Surynek
SIROCCO
2007
13 years 10 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...
COCOA
2009
Springer
14 years 1 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya