Sciweavers

514 search results - page 22 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
119
Voted
CSL
2009
Springer
15 years 4 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
TNN
2011
129views more  TNN 2011»
14 years 7 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino
CDC
2009
IEEE
127views Control Systems» more  CDC 2009»
15 years 3 months ago
A new perspective on control of uncertain complex systems
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...
Shin Li
94
Voted
CAS
2008
118views more  CAS 2008»
15 years 16 days ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer
112
Voted
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 12 days ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...