Sciweavers

3757 search results - page 563 / 752
» The overlap number of a graph
Sort
View
IROS
2008
IEEE
125views Robotics» more  IROS 2008»
16 years 27 days ago
Neighborhood denoising for learning high-dimensional grasping manifolds
— Human control of high degree-of-freedom robotic systems, e.g. anthropomorphic robot hands, is often difficult due to the overwhelming number of variables that need to be speci...
Aggeliki Tsoli, Odest Chadwicke Jenkins
IV
2008
IEEE
158views Visualization» more  IV 2008»
16 years 27 days ago
ComVis: A Coordinated Multiple Views System for Prototyping New Visualization Technology
There is a large number of interactive visualization tools, however no universal tool exists that covers all relevant aspects for all possible application domains. We have develop...
Kresimir Matkovic, Wolfgang Freiler, Denis Gracani...
SASO
2008
IEEE
16 years 26 days ago
Connectivity Service for Mobile Ad-Hoc Networks
Abstract—We present a distributed connectivity service that allows agents in a mobile ad-hoc network to move while preserving connectivity. This allows unmodified motion plannin...
Alejandro Cornejo, Nancy A. Lynch
GLOBECOM
2007
IEEE
16 years 25 days ago
On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
Ashutosh Deepak Gore, Abhay Karandikar, Srikanth J...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
16 years 20 days ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum