Sciweavers

1243 search results - page 17 / 249
» Complexity reduction of C-Algorithm
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
12 years 12 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
PKDD
2004
Springer
116views Data Mining» more  PKDD 2004»
15 years 2 months ago
Random Matrices in Data Analysis
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
Dimitris Achlioptas
IJCSS
2000
79views more  IJCSS 2000»
14 years 9 months ago
Impact of learning set quality and size on decision tree performances
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli
Marc Sebban, Richard Nock, Jean-Hugues Chauchat, R...
JAR
2007
142views more  JAR 2007»
14 years 9 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
GLOBECOM
2007
IEEE
15 years 3 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu