Sciweavers

12052 search results - page 312 / 2411
» computing 2010
Sort
View
SIAMDM
2010
84views more  SIAMDM 2010»
15 years 5 months ago
On Computing the Frequencies of Induced Subhypergraphs
Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
Brendan Nagle
TVCG
2010
162views more  TVCG 2010»
15 years 5 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
FSTTCS
2010
Springer
15 years 4 months ago
On extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
Pavel Pudlák
IBERAMIA
2010
Springer
15 years 4 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
ICASSP
2010
IEEE
15 years 4 months ago
Learning from other subjects helps reducing Brain-Computer Interface calibration time
A major limitation of Brain-Computer Interfaces (BCI) is their long calibration time, as much data from the user must be collected in order to tune the BCI for this target user. I...
Fabien Lotte, Cuntai Guan