Sciweavers

107 search results - page 13 / 22
» Polynomially Bounded Matrix Interpretations
Sort
View
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 8 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
JAT
2010
60views more  JAT 2010»
13 years 5 months ago
Growth properties of Nevanlinna matrices for rational moment problems
We consider rational moment problems on the real line with their associated orthogonal rational functions. There exists a Nevanlinna type parameterization relating to the problem,...
Adhemar Bultheel, Pablo González-Vera, Erik...
COLT
2010
Springer
13 years 4 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
HYBRID
2007
Springer
14 years 26 days ago
Optimal Switches in Multi-inventory Systems
Given a switched multi–inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function relat...
Dario Bauso
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 6 months ago
Visibility maintenance via controlled invariance for leader-follower Dubins-like vehicles
The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of robots modelled as first-order dynamic systems and proposes an original solution based on t...
Fabio Morbidi, Francesco Bullo, Domenico Prattichi...