Sciweavers

1450 search results - page 267 / 290
» Complexity of Inference in Graphical Models
Sort
View
COMPGEOM
2008
ACM
13 years 10 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
JIKM
2008
98views more  JIKM 2008»
13 years 8 months ago
Knowledge-Based Expert System Development and Validation with Petri Nets
Expert systems (ESs) are complex information systems that are expensive to build and difficult to validate. Numerous knowledge representation strategies such as rules, semantic net...
Madjid Tavana
CGF
2005
170views more  CGF 2005»
13 years 8 months ago
Structure Recovery via Hybrid Variational Surface Approximation
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to repre...
Jianhua Wu, Leif Kobbelt
TVCG
2008
138views more  TVCG 2008»
13 years 8 months ago
Real-Time Path Planning in Dynamic Virtual Environments Using Multiagent Navigation Graphs
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
CVPR
2012
IEEE
12 years 2 months ago
Branch-and-price global optimization for multi-view multi-object tracking
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
Laura Leal-Taixe, Gerard Pons-Moll, Bodo Rosenhahn