Sciweavers

3678 search results - page 15 / 736
» On the Stable Paths Problem
Sort
View
143
Voted
ICRA
2009
IEEE
248views Robotics» more  ICRA 2009»
15 years 10 months ago
Moving obstacle detection in highly dynamic scenes
Abstract— We address the problem of vision-based multiperson tracking in busy pedestrian zones using a stereo rig mounted on a mobile platform. Specifically, we are interested i...
Andreas Ess, Bastian Leibe, Konrad Schindler, Luc ...
CSC
2009
15 years 4 months ago
A New Iterative Method for Solving Initial Value Problems
- In this paper, we introduce a new parameter iteration method (P-Iteration for short) which can be applied on Adams-Moulton methods to solve initial value problems. Compared with ...
Mingshen Wu, Weihu Hong
148
Voted
PAAPP
1998
149views more  PAAPP 1998»
15 years 3 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
163
Voted
GLOBECOM
2010
IEEE
15 years 1 months ago
Queue-Stability-Based Transmission Power Control in Wireless Multihop Networks
In this paper, we study the problem of transmission power control and its effects on the link-scheduling performance when a set of end-to-end flows established in the network are g...
Gustavo Vejarano, Janise McNair
SOICT
2010
14 years 10 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...