Sciweavers

3008 search results - page 173 / 602
» Independence in connected graphs
Sort
View
ICAS
2006
IEEE
145views Robotics» more  ICAS 2006»
16 years 17 days ago
A Model-Driven Development Framework for Non-Functional Aspects in Service Oriented Grids
Service-oriented grids are grid computing systems built with the notion of service-oriented architecture (SOA). Using two maract concepts, services and connections between service...
Hiroshi Wada, Junichi Suzuki, Katsuya Oba
ALT
2007
Springer
15 years 10 months ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
IM
2008
15 years 6 months ago
The Structure of Geographical Threshold Graphs
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
MOBICOM
2012
ACM
13 years 9 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
AGENTS
1997
Springer
15 years 10 months ago
Learning View Graphs for Robot Navigation
Abstract. We present a purely vision-based scheme for learning a topological representation of an open environment. The system represents selected places by local views of the surr...
Matthias O. Franz, Bernhard Schölkopf, Philip...