Sciweavers

851 search results - page 129 / 171
» Random constructions and density results
Sort
View
IJWMC
2010
115views more  IJWMC 2010»
14 years 7 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
TIT
2010
114views Education» more  TIT 2010»
14 years 4 months ago
The balanced unicast and multicast capacity regions of large wireless networks
We consider the question of determining the scaling of the n2 -dimensional balanced unicast and the n2n dimensional balanced multicast capacity regions of a wireless network with ...
Urs Niesen, Piyush Gupta, Devavrat Shah
RANDOM
1998
Springer
15 years 2 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
SAC
2006
ACM
15 years 4 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
CCS
2003
ACM
15 years 3 months ago
Cryptographic tamper evidence
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
Gene Itkis