Sciweavers

3008 search results - page 86 / 602
» Independence in connected graphs
Sort
View
AUTOMATICA
2010
95views more  AUTOMATICA 2010»
15 years 6 months ago
Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
Tove Gustavi, Dimos V. Dimarogonas, Magnus Egerste...
CVPR
2003
IEEE
16 years 8 months ago
PAMPAS: Real-Valued Graphical Models for Computer Vision
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
Michael Isard
STACS
2005
Springer
15 years 11 months ago
Connectivity for Wireless Agents Moving on a Cycle or Grid
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
Josep Díaz-Giménez, Xavier Pé...
OPODIS
2007
15 years 7 months ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
ISQED
2005
IEEE
64views Hardware» more  ISQED 2005»
15 years 12 months ago
Design of High Performance Sense Amplifier Using Independent Gate Control in sub-50nm Double-Gate MOSFET
Double-Gate (DG) transistor has emerged as the most promising device for nano-scale circuit design. Independent control of front and back gate in DG devices can be effectively use...
Saibal Mukhopadhyay, Hamid Mahmoodi-Meimand, Kaush...