Sciweavers

1986 search results - page 93 / 398
» Path Separability of Graphs
Sort
View
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
13 years 7 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
13 years 6 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...
ISSS
1998
IEEE
103views Hardware» more  ISSS 1998»
14 years 1 months ago
False Path Analysis Based on a Hierarchical Control Representation
False path analysis is an activity with applications in a variety of computer science and engineering domains like for instance high-level synthesis, worst case execution time est...
Apostolos A. Kountouris, Christophe Wolinski
RSA
2010
118views more  RSA 2010»
13 years 7 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
SCN
2008
Springer
128views Communications» more  SCN 2008»
13 years 8 months ago
On Linear Secret Sharing for Connectivity in Directed Graphs
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
Amos Beimel, Anat Paskin