384 search results - page 56 / 77 » Equivalence Relations on Classes of Computable Structures |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, a novel subspace learning method, semi-supervised marginal discriminant analysis (SMDA), is proposed for classification. SMDA aims at maintaining the intrinsic neig...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
CDC
2009
IEEE
14 years 13 days ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...