Sciweavers

650 search results - page 33 / 130
» Positive graphs
Sort
View
SIAMSC
2008
182views more  SIAMSC 2008»
14 years 9 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
ISAAC
2009
Springer
103views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3-edge-connected PSLG, then 2n−2 new edges are enou...
Marwan Al-Jubeh, Mashhood Ishaque, Kristóf ...
IJRR
2006
119views more  IJRR 2006»
14 years 9 months ago
Predicting the Performance of Cooperative Simultaneous Localization and Mapping (C-SLAM)
In this paper we study the time evolution of the position estimates' covariance in Cooperative Simultaneous Localization and Mapping (C-SLAM), and obtain analytical upper boun...
Anastasios I. Mourikis, Stergios I. Roumeliotis
57
Voted
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 3 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon
JDA
2008
94views more  JDA 2008»
14 years 9 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...