Sciweavers

14548 search results - page 451 / 2910
» The Optimal Path-Matching Problem
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 5 months ago
An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors a...
Matthias Hein, Thomas Bühler
TEC
2010
120views more  TEC 2010»
15 years 2 months ago
Benefits of a Population: Five Mechanisms That Advantage Population-Based Algorithms
This paper identifies five distinct mechanisms by which a population-based algorithm might have an advantage over a solo-search algorithm in classical optimization. These mechanism...
Adam Prügel-Bennett
TROB
2010
103views more  TROB 2010»
15 years 2 months ago
Time Parameterization of Humanoid-Robot Paths
Abstract--This paper proposes a unified optimization framework to solve the time parameterization problem of humanoid robot paths. Even though the time parameterization problem is ...
Wael Suleiman, Fumio Kanehiro, Eiichi Yoshida, Jea...
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 10 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
JMLR
2012
13 years 10 months ago
Marginal Regression For Multitask Learning
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
Mladen Kolar, Han Liu