Sciweavers

2214 search results - page 26 / 443
» complexity 2004
Sort
View
FSTTCS
2004
Springer
14 years 29 days ago
Subdividing Alpha Complex
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...
Ho-Lun Cheng, Tony Tan
ICA
2004
Springer
14 years 28 days ago
Unraveling Spatio-temporal Dynamics in fMRI Recordings Using Complex ICA
Abstract. Independent component analysis (ICA) of functional magnetic resonance imaging (fMRI) data is commonly carried out under the assumption that each source may be represented...
Jörn Anemüller, Jeng-Ren Duann, Terrence...
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
14 years 29 days ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez
WSC
2004
13 years 9 months ago
A Probabilistic Total System Approach to the Simulation of Complex Environmental Systems
GoldSim is a powerful and flexible Windows-based computer program for carrying out probabilistic simulations of complex systems to support management and decisionmaking in enginee...
Rick Kossik, Ian Miller
AAAI
2004
13 years 9 months ago
The Complexity of Global Constraints
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
Christian Bessière, Emmanuel Hebrard, Brahi...