Sciweavers

485 search results - page 53 / 97
» Iterative Bounding LAO
Sort
View
85
Voted
VC
2008
102views more  VC 2008»
14 years 10 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
72
Voted
CORR
2009
Springer
114views Education» more  CORR 2009»
14 years 8 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol
120
Voted
JMLR
2010
145views more  JMLR 2010»
14 years 5 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer
96
Voted
TWC
2010
14 years 5 months ago
Optimized Training Sequences for Spatially Correlated MIMO-OFDM
In this paper, the training sequence design for multiple-input multiple-output (MIMO) orthogonal frequencydivision multiplexing (OFDM) systems under the minimum mean square error (...
Hoang Duong Tuan, Ha Hoang Kha, Ha H. Nguyen, Viet...
95
Voted
ANOR
2011
117views more  ANOR 2011»
14 years 1 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover