Sciweavers

3875 search results - page 448 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 6 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist
IJFCS
2006
87views more  IJFCS 2006»
15 years 6 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
PR
2008
170views more  PR 2008»
15 years 6 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
15 years 5 months ago
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
Salvatore Candido, James C. Davidson, Seth Hutchin...
JMLR
2010
195views more  JMLR 2010»
15 years 5 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...