Sciweavers

62 search results - page 12 / 13
» Approximating Node-Connectivity Augmentation Problems
Sort
View
COLT
2007
Springer
14 years 1 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 7 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
CORR
2011
Springer
241views Education» more  CORR 2011»
13 years 2 months ago
An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...
Yangyang Xu, Wotao Yin, Zaiwen Wen, Yin Zhang
AAAI
2006
13 years 9 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang
CSL
2007
Springer
13 years 7 months ago
Soft indexing of speech content for search in spoken documents
The paper presents the Position Specific Posterior Lattice (PSPL), a novel lossy representation of automatic speech recognition lattices that naturally lends itself to efficient ...
Ciprian Chelba, Jorge Silva, Alex Acero