Sciweavers

2863 search results - page 44 / 573
» Constructing minimum-interference networks
Sort
View
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 1 months ago
Constructive, Deterministic Implementation of Shared Memory on Meshes
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
ACNS
2010
Springer
155views Cryptology» more  ACNS 2010»
15 years 4 months ago
Redactable Signatures for Tree-Structured Data: Definitions and Constructions
ded abstract of this paper appears in Applied Cryptography and Network Security
Christina Brzuska, Heike Busch, Özgür Da...
PPSN
1990
Springer
15 years 5 months ago
Feature Construction for Back-Propagation
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
Selwyn Piramuthu
TMC
2011
131views more  TMC 2011»
14 years 8 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
IPL
2010
141views more  IPL 2010»
14 years 8 months ago
On the differential and linear efficiency of balanced Feistel networks
Balanced Feistel networks (BFN) have been widely used for constructing efficient block ciphers. They are known to provide high efficiency with respect to differential and linear c...
Andrey Bogdanov