Sciweavers

1672 search results - page 194 / 335
» Tightness problems in the plane
Sort
View
COMPGEOM
2008
ACM
15 years 1 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...
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
15 years 20 days ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer
IIS
2004
15 years 18 days ago
Automatic Understanding of Signals
Using computers for different task including enhancement, description and evaluation of signals we typically include three steps: signal processing (for obtaining signal of better ...
Ryszard Tadeusiewicz
TMI
2008
135views more  TMI 2008»
14 years 11 months ago
A Factorization Approach for Cone-Beam Reconstruction on a Circular Short-Scan
In this paper, we introduce a new algorithm for 3-D image reconstruction from cone-beam (CB) projections acquired along a partial circular scan. Our algorithm is based on a novel, ...
Frank Dennerlein, Frédéric Noo, H. S...
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
14 years 9 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...