1845 search results - page 293 / 369 » Machine-Learning Applications of Algorithmic Randomness |
JCO
2010
13 years 6 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
EUROPAR
2009
Springer
13 years 5 months ago
2009
Springer
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
JMLR
2010
13 years 2 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
ICASSP
2011
IEEE
12 years 12 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...