Sciweavers

2661 search results - page 192 / 533
» Quantum Complexity Classes
Sort
View
141
Voted
NN
2007
Springer
112views Neural Networks» more  NN 2007»
15 years 3 months ago
An augmented CRTRL for complex-valued recurrent neural networks
Real world processes with an “intensity” and “direction” component can be made complex by convenience of representation (vector fields, radar, sonar), and their processin...
Su Lee Goh, Danilo P. Mandic
134
Voted
ADBIS
2009
Springer
148views Database» more  ADBIS 2009»
15 years 10 months ago
On Containment of Conjunctive Queries with Negation
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
Victor Felea
92
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
A Non-Commutative Generalization of ElGamal Key Exchange using Polycyclic Groups
Abstract— In this paper, we propose a non-commutative keyexchange scheme which generalizes the classical ElGamal Cipher to polycyclic groups. We will explore other classes of gro...
Delaram Kahrobaei, Bilal Khan
135
Voted
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
15 years 7 months ago
Grid Graph Reachability Problems
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
IJCAI
1997
15 years 4 months ago
Strategies in Rigid-Variable Methods
We study complexity of methods using rigid variables, like the method of matings or the tableau method, on a decidable class of predicate calculus with equality. We show some intr...
Andrei Voronkov