Sciweavers

559 search results - page 4 / 112
» Augmented Marked Graphs
Sort
View
WADS
2007
Springer
91views Algorithms» more  WADS 2007»
14 years 2 months ago
Kernelization and Complexity Results for Connectivity Augmentation Problems
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
Jiong Guo, Johannes Uhlmann
IJNSEC
2007
127views more  IJNSEC 2007»
13 years 8 months ago
Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
Tsz-Yeung Wong, John Chi-Shing Lui, Man Hon Wong
ORL
2008
115views more  ORL 2008»
13 years 8 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama
CHI
2002
ACM
14 years 9 months ago
AR Pad: an interface for face-to-face AR collaboration
The AR Pad is a handheld display with a Spaceball and a camera, which can be used to view and interact with Augmented Reality models in collaborative setting. Keywords Augmented R...
D. Mogilev, Kiyoshi Kiyokawa, Mark Billinghurst, J...