Sciweavers

204 search results - page 4 / 41
» Parameterized Complexity of Cardinality Constrained Optimiza...
Sort
View
JMLR
2010
155views more  JMLR 2010»
13 years 1 months ago
Structured Sparse Principal Component Analysis
We present an extension of sparse PCA, or sparse dictionary learning, where the sparsity patterns of all dictionary elements are structured and constrained to belong to a prespeci...
Rodolphe Jenatton, Guillaume Obozinski, Francis Ba...
ICALP
2009
Springer
14 years 6 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
TSP
2012
12 years 2 months ago
Sensing and Probing Cardinalities for Active Cognitive Radios
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
Thang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, ...
TVCG
2008
167views more  TVCG 2008»
13 years 5 months ago
Optimal Surface Parameterization Using Inverse Curvature Map
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
Yong-Liang Yang, Junho Kim, Feng Luo 0002, Shi-Min...
CEC
2007
IEEE
14 years 29 days ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...