Sciweavers

1554 search results - page 174 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
80
Voted
ICRA
2010
IEEE
99views Robotics» more  ICRA 2010»
15 years 1 months ago
Retraction-based RRT planner for articulated models
— We present a new retraction algorithm for high DOF articulated models and use our algorithm to improve the performance of RRT planners in narrow passages. The retraction step i...
Jia Pan, Liangjun Zhang, Dinesh Manocha
132
Voted
WAE
1998
118views Algorithms» more  WAE 1998»
15 years 4 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
CVPR
2000
IEEE
16 years 5 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
ICCV
2005
IEEE
16 years 5 months ago
Object Recognition in High Clutter Images Using Line Features
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
Philip David, Daniel DeMenthon
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 3 months ago
On Optimum Power Allocation for the V-BLAST
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
Victoria Kostina, Sergey Loyka