Sciweavers

356 search results - page 49 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
ICDM
2008
IEEE
160views Data Mining» more  ICDM 2008»
14 years 2 months ago
Direct Zero-Norm Optimization for Feature Selection
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
Kaizhu Huang, Irwin King, Michael R. Lyu
IJAR
2008
95views more  IJAR 2008»
13 years 7 months ago
Rule reduction for efficient inferencing in similarity based reasoning
The two most important models of inferencing in approximate reasoning with fuzzy sets are Zadeh's Compositional Rule of Inference (CRI) and Similarity Based Reasoning (SBR). ...
Balasubramaniam Jayaram
COMPGEOM
2006
ACM
14 years 1 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel
CISS
2011
IEEE
12 years 11 months ago
Sparsity penalties in dynamical system estimation
—In this work we address the problem of state estimation in dynamical systems using recent developments in compressive sensing and sparse approximation. We formulate the traditio...
Adam Charles, Muhammad Salman Asif, Justin K. Romb...