Sciweavers

1529 search results - page 90 / 306
» Energy-Based Models of P Systems
Sort
View
CCS
2010
ACM
14 years 10 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
NIPS
1998
14 years 11 months ago
Modeling Surround Suppression in V1 Neurons with a Statistically Derived Normalization Model
We examine the statistics of natural monochromatic images decomposed using a multi-scale wavelet basis. Although the coefficients of this representation are nearly decorrelated, t...
Eero P. Simoncelli, Odelia Schwartz
IPSN
2004
Springer
15 years 3 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
QEST
2008
IEEE
15 years 4 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
FM
2003
Springer
160views Formal Methods» more  FM 2003»
15 years 3 months ago
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
Fei Xie, James C. Browne, Robert P. Kurshan