Sciweavers

1859 search results - page 34 / 372
» Sketch-based path design
Sort
View
IROS
2008
IEEE
149views Robotics» more  IROS 2008»
15 years 9 months ago
A position-based visual servoing scheme for following paths with nonholonomic mobile robots
Abstract— We present a visual servoing scheme enabling nonholonomic mobile robots with a fixed pinhole camera to reach and follow a continuous path on the ground. The controller...
Andrea Cherubini, François Chaumette, Giuse...
ICALP
2010
Springer
15 years 7 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis
112
Voted
NIPS
2004
15 years 4 months ago
Following Curved Regularized Optimization Solution Paths
Regularization plays a central role in the analysis of modern data, where non-regularized fitting is likely to lead to over-fitted models, useless for both prediction and interpre...
Saharon Rosset
WEBNET
2000
15 years 4 months ago
Evolution of the Walden's Paths Authoring Tools
: Changing user skills, available infrastructure, and work practices have caused many differences in the authoring support provided by the Walden's Paths project since its con...
Unmil Karadkar, Luis Francisco-Revilla, Richard Fu...
167
Voted
OL
2011
277views Neural Networks» more  OL 2011»
14 years 10 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...