Sciweavers

418 search results - page 40 / 84
» A relaxation-based algorithm for solving the conditional p-c...
Sort
View
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 9 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 2 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
FOCS
2002
IEEE
14 years 1 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
14 years 3 months ago
Robust stabilization for arbitrarily switched linear systems with time-varying delays and uncertainties
Abstract— This paper studies the robust stability and stabilization problems for switched linear discrete-time systems. The parameter uncertainties in the system under considerat...
Lixian Zhang, Peng Shi, Michael V. Basin
ICASSP
2011
IEEE
13 years 13 days ago
Rao-Blackwellized particle filter for Gaussian mixture models and application to visual tracking
One of the most important problems in visual tracking is how to incrementally update the appearance model because the appearance of a target object can be easily changed with time...
Jungho Kim, In-So Kweon