3758 search results - page 9 / 752 » A Complete Subsumption Algorithm |
171
click to vote
TASLP
2011
15 years 23 days ago
2011
—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...
176
click to vote
JMLR
2012
13 years 8 months ago
2012
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...
152
click to vote
JMLR
2010
15 years 19 days ago
2010
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...
194
click to vote
CDC
2010
IEEE
15 years 25 days ago
2010
IEEE
Abstract-- We propose an algorithm for decentralised navigation of multiple independent agents, applicable to Robotics and Air Traffic Control (ATC). We present completely decentra...
143
click to vote
SEMWEB
2009
Springer
16 years 11 days ago
2009
Springer
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...