Sciweavers

811 search results - page 12 / 163
» Avoiding Approximate Squares
Sort
View
ICRA
1998
IEEE
157views Robotics» more  ICRA 1998»
13 years 11 months ago
VFH+: Reliable Obstacle Avoidance for Fast Mobile Robots
This paper presents further developments of the earlier Vector Field Histogram (VFH) method for realtime mobile robot obstacle avoidance. The enhanced method, called VFH+, offers ...
Iwan Ulrich, Johann Borenstein
ICASSP
2008
IEEE
14 years 1 months ago
A fast approximate joint diagonalization algorithm using a criterion with a block diagonal weight matrix
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
Petr Tichavský, Arie Yeredor, Jan Nielsen
SWAT
2004
Springer
117views Algorithms» more  SWAT 2004»
14 years 24 days ago
Maximizing the Number of Packed Rectangles
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
Klaus Jansen, Guochuan Zhang
TCS
2008
13 years 7 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
MA
2010
Springer
132views Communications» more  MA 2010»
13 years 5 months ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki