Sciweavers

356 search results - page 22 / 72
» Pairwise Cardinality Networks
Sort
View
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 1 months ago
Time-and-Frequency-Hopping Optical Orthogonal Codes with Hierarchical Cross-Correlation Constraints for Service Differentiation
— In this paper, we consider time-and-frequency hopping (TFH) codes for optical code-division multiple-access (OCDMA) networks. To support the differentiated service requirements...
Chung-Keun Lee, Seung-Woo Seo
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 20 days ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
DAWAK
2008
Springer
13 years 9 months ago
Workload-Aware Histograms for Remote Applications
Recently several database-based applications have emerged that are remote from data sources and need accurate histograms for query cardinality estimation. Traditional approaches fo...
Tanu Malik, Randal C. Burns
SASN
2005
ACM
14 years 1 months ago
A key pre-distribution scheme for secure sensor networks using probability density function of node deployment
Pairwise key establishment is a fundamental service provided in secure sensor networks. However, due to resource constraints, establishing pairwise keys is not a trivial task. Rec...
Takashi Ito, Hidenori Ohta, Nori Matsuda, Takeshi ...
TON
2012
11 years 10 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...