Sciweavers

376 search results - page 47 / 76
» Completely connected clustered graphs
Sort
View
HIS
2009
13 years 5 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
ICCV
2011
IEEE
12 years 7 months ago
Probabilistic Group-Level Motion Analysis and Scenario Recognition
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
Ming-Ching Chang, Nils Krahnstoever, Weina Ge
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
13 years 12 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
DSN
2011
IEEE
12 years 7 months ago
Modeling stream processing applications for dependability evaluation
— This paper describes a modeling framework for evaluating the impact of faults on the output of streaming ions. Our model is based on three abstractions: stream operators, strea...
Gabriela Jacques-Silva, Zbigniew Kalbarczyk, Bugra...
IPSN
2004
Springer
14 years 1 months ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak