Sciweavers

829 search results - page 15 / 166
» Distance domination-critical graphs
Sort
View
SIGCOMM
2009
ACM
15 years 4 months ago
Temporal distance metrics for social network analysis
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
15 years 10 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
INCDM
2007
Springer
121views Data Mining» more  INCDM 2007»
15 years 3 months ago
Collaborative Filtering Using Electrical Resistance Network Models
Abstract. In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and r...
Jérôme Kunegis, Stephan Schmidt
WG
2010
Springer
14 years 7 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
RFIDSEC
2010
14 years 7 months ago
The Poulidor Distance-Bounding Protocol
RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermeasure against these types of attacks are the well-...
Rolando Trujillo-Rasua, Benjamin Martin 0002, Gild...