19320 search results - page 194 / 3864 » On the complexity of computing determinants |
193
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
169
click to vote
ARTMED
2006
15 years 6 months ago
2006
Objective: Knowledge acquisition and maintenance in medical domains with a large application domain ontology is a difficult task. To reduce knowledge elicitation costs, semiautoma...
170
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
196
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
211
click to vote
IJCNN
2008
IEEE
16 years 28 days ago
2008
IEEE
— Gene expression based cancer classification using classifier ensembles is the main focus of this work. A new ensemble method is proposed that combines predictions of a small ...