Sciweavers

215 search results - page 42 / 43
» Sums of squares based approximation algorithms for MAX-SAT
Sort
View
TROB
2008
154views more  TROB 2008»
13 years 4 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
13 years 11 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
ICA
2010
Springer
13 years 7 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
ALT
2003
Springer
14 years 3 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
BMCBI
2008
132views more  BMCBI 2008»
13 years 6 months ago
Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
Raffaele Giancarlo, Davide Scaturro, Filippo Utro