Sciweavers

201 search results - page 19 / 41
» The Connectivity of addition Cayley graphs
Sort
View
IFM
2009
Springer
155views Formal Methods» more  IFM 2009»
13 years 5 months ago
Application of Graph Transformation in Verification of Dynamic Systems
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
Zarrin Langari, Richard J. Trefler
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
13 years 11 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
NIPS
2004
13 years 8 months ago
Contextual Models for Object Detection Using Boosted Random Fields
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
Antonio Torralba, Kevin P. Murphy, William T. Free...
COCOA
2009
Springer
14 years 2 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Thomas Dueholm Hansen, Orestis Telelis
TON
2010
196views more  TON 2010»
13 years 2 months ago
Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
Shrinivasa Kini, S. Ramasubramanian, Amund Kvalbei...