Sciweavers

4565 search results - page 601 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
IJCAI
2003
15 years 4 months ago
Multi-prototype Support Vector Machine
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
Fabio Aiolli, Alessandro Sperduti
IJCGA
2006
85views more  IJCGA 2006»
15 years 3 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
IJCGA
2006
79views more  IJCGA 2006»
15 years 3 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
AUTOMATICA
2010
123views more  AUTOMATICA 2010»
15 years 1 months ago
On the computation of linear model predictive control laws
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...
Francesco Borrelli, Mato Baotic, Jaroslav Pekar, G...
FCCM
2005
IEEE
106views VLSI» more  FCCM 2005»
15 years 9 months ago
High-Performance FPGA-Based General Reduction Methods
FPGA-based floating-point kernels must exploit algorithmic parallelism and use deeply pipelined cores to gain a performance advantage over general-purpose processors. Inability t...
Gerald R. Morris, Ling Zhuo, Viktor K. Prasanna