Sciweavers

2446 search results - page 332 / 490
» Choiceless Polynomial Time
Sort
View
CSL
2010
Springer
13 years 8 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
IJHPCA
2006
125views more  IJHPCA 2006»
13 years 8 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ENVSOFT
2007
78views more  ENVSOFT 2007»
13 years 7 months ago
A multi-model approach to analysis of environmental phenomena
Abstract: This paper introduces a novel data-driven methodology named Evolutionary Polynomial Regression (EPR), which permits the multi-purpose modelling of physical phenomena, thr...
Orazio Giustolisi, Angelo Doglioni, D. A. Savic, B...
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 7 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...