Sciweavers

2182 search results - page 26 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan
CP
2005
Springer
14 years 1 months ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
TIP
2008
124views more  TIP 2008»
13 years 7 months ago
Robust Shape Tracking With Multiple Models in Ultrasound Images
This paper addresses object tracking in ultrasound images using a robust multiple model tracker. The proposed tracker has the following features: 1) it uses multiple dynamic models...
Jacinto C. Nascimento, Jorge S. Marques
ICML
2007
IEEE
14 years 8 months ago
Robust non-linear dimensionality reduction using successive 1-dimensional Laplacian Eigenmaps
Non-linear dimensionality reduction of noisy data is a challenging problem encountered in a variety of data analysis applications. Recent results in the literature show that spect...
Samuel Gerber, Tolga Tasdizen, Ross T. Whitaker
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 1 months ago
Solving Consensus and Semi-supervised Clustering Problems Using Nonnegative Matrix Factorization
Consensus clustering and semi-supervised clustering are important extensions of the standard clustering paradigm. Consensus clustering (also known as aggregation of clustering) ca...
Tao Li, Chris H. Q. Ding, Michael I. Jordan