Sciweavers

178 search results - page 11 / 36
» A Simple Algorithm for Nuclear Norm Regularized Problems
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
13 years 11 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
SIAMIS
2010
114views more  SIAMIS 2010»
13 years 5 months ago
Improved Total Variation-Type Regularization Using Higher Order Edge Detectors
We present a novel deconvolution approach to accurately restore piecewise smooth signals from blurred data. The first stage uses Higher Order Total Variation restorations to obtai...
Wolfgang Stefan, Rosemary A. Renaut, Anne Gelb
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 6 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
CSL
2003
Springer
14 years 18 days ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...