Sciweavers

3105 search results - page 382 / 621
» The Path-Packing Structure of Graphs
Sort
View
VR
2007
IEEE
141views Virtual Reality» more  VR 2007»
15 years 10 months ago
Real-time Path Planning for Virtual Agents in Dynamic Environments
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
GI
2007
Springer
15 years 10 months ago
A New Approach for Estimating Depth by Fusing Stereo and Defocus Information
: Several algorithms are common for estimating depth from stereo series, but many of them have difficulties when determining depth of objects having periodical structure. This con...
Ioana Gheta, Christian Frese, Michael Heizmann, J&...
DIAL
2006
IEEE
103views Image Analysis» more  DIAL 2006»
15 years 10 months ago
Multi-Queue Merging Scheme And Its Application in Arabic Script Segmentation
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
Pingping Xiu, Liangrui Peng, Xiaoqing Ding
ICALT
2006
IEEE
15 years 10 months ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 10 months ago
Coverage Diameters of Polygons
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
Pawin Vongmasa, Attawith Sudsang