Sciweavers

3758 search results - page 9 / 752
» A Complete Subsumption Algorithm
Sort
View
TASLP
2011
13 years 2 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský
JMLR
2012
11 years 10 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
JMLR
2010
109views more  JMLR 2010»
13 years 2 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
13 years 2 months ago
Completely decentralised navigation of multiple unicycle agents with prioritisation and fault tolerance
Abstract-- We propose an algorithm for decentralised navigation of multiple independent agents, applicable to Robotics and Air Traffic Control (ATC). We present completely decentra...
Giannis P. Roussos, Kostas J. Kyriakopoulos
SEMWEB
2009
Springer
14 years 2 months ago
Exploiting Partial Information in Taxonomy Construction
One of the core services provided by OWL reasoners is classification: the discovery of all subclass relationships between class names occurring in an ontology. Discovering these r...
Rob Shearer, Ian Horrocks