Sciweavers

29908 search results - page 355 / 5982
» On the complexity of communication complexity
Sort
View
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
16 years 7 days ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ICA
2004
Springer
16 years 4 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...
ICDAR
2003
IEEE
16 years 1 days ago
A Flexible Recognition Engine for Complex On-line Handwritten Character Recognition
A major feature of new mobiles terminals using penbased interfaces, such as personal assistants or e-book, is their personal character, implying that a good interface should be ea...
Sanparith Marukatat, Rudy Sicard, Thierry Arti&egr...
ATAL
2003
Springer
16 years 7 hour ago
Agent network topology and complexity
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
Xiaolong Jin, Jiming Liu
140
Voted
LICS
2002
IEEE
15 years 11 months ago
Complete Problems for Dynamic Complexity Classes
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
William Hesse, Neil Immerman