Sciweavers

2465 search results - page 471 / 493
» Automata on Linear Orderings
Sort
View
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
ICPP
1990
IEEE
15 years 1 months ago
Reducing Memory and Traffic Requirements for Scalable Directory-Based Cache Coherence Schemes
As multiprocessors are scaled beyond single bus systems, there is renewed interest in directory-based cache coherence schemes. These schemes rely on a directory to keep track of a...
Anoop Gupta, Wolf-Dietrich Weber, Todd C. Mowry
ACSAC
2007
IEEE
15 years 1 months ago
Efficient Detection of Delay-Constrained Relay Nodes
Relay nodes are a potential threat to networks since they are used in many malicious situations like stepping stone attacks, botnet communication, peer-to-peer streaming etc. Quic...
Baris Coskun, Nasir D. Memon
BIBM
2007
IEEE
104views Bioinformatics» more  BIBM 2007»
15 years 1 months ago
A Protocol to Detect Local Affinities Involved in Proteins Distant Interactions
The tridimensional structure of a protein is constrained or stabilized by some local interactions between distant residues of the protein, such as disulfide bonds, electrostatic i...
Christophe Nicolas Magnan, Cécile Capponi, ...