Sciweavers

17760 search results - page 313 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
SIAMJO
2002
92views more  SIAMJO 2002»
15 years 6 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
TNN
1998
123views more  TNN 1998»
15 years 6 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
ICRA
2010
IEEE
106views Robotics» more  ICRA 2010»
15 years 5 months ago
Generalized direction changing fall control of humanoid robots among multiple objects
— Humanoid robots are expected to share human environments in the future and it is important to ensure safety of their operation. A serious threat to safety is the fall of a huma...
Umashankar Nagarajan, Ambarish Goswami
CVPR
2000
IEEE
16 years 8 months ago
Algorithms for Plane-Based Pose Estimation
We present several methods for the estimation of relative pose between planes and cameras, based on projections of sets of coplanar features in images. While such methods exist fo...
Peter F. Sturm