Sciweavers

10054 search results - page 208 / 2011
» On the Complexity of Function Learning
Sort
View
ICA
2004
Springer
15 years 6 months 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...
86
Voted
APL
1998
ACM
15 years 5 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
117
Voted
JMLR
2010
144views more  JMLR 2010»
14 years 7 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
98
Voted
ICALP
2009
Springer
16 years 1 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
106
Voted
ICALP
2007
Springer
15 years 7 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...