Sciweavers

26518 search results - page 14 / 5304
» On achieving the
Sort
View
185
Voted
DAWAK
2006
Springer
15 years 9 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
NETWORKING
2007
15 years 7 months ago
Improving XCP to Achieve Max-Min Fair Bandwidth Allocation
TCP is shown to be inefficient and instable in high speed and long latency networks. The eXplicit Control Protocol (XCP) is a new and promising protocol that outperforms TCP in ter...
Lei Zan, Xiaowei Yang
CORR
2006
Springer
116views Education» more  CORR 2006»
15 years 5 months ago
On the Fading Paper Achievable Region of the Fading MIMO Broadcast Channel
We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the ...
Amir Bennatan, David Burshtein
MICCAI
2010
Springer
15 years 4 months ago
A Statistical Approach for Achievable Dose Querying in IMRT Planning
The task of IMRT planning, particularly in head-and-neck cancer, is a difficult one, often requiring days of work from a trained dosimetrist. One of the main challenges is the pres...
Patricio D. Simari, Binbin Wu, Robert Jacques, Ale...
TMC
2010
126views more  TMC 2010»
15 years 4 months ago
Achievable Capacity in Hybrid DS-CDMA/OFDM Spectrum-Sharing
—In this paper, we consider DS-CDMA/OFDM spectrum sharing systems and obtain the achievable capacity of the secondary service under different subchannel selection policies in the...
Mohammad G. Khoshkholgh, Keivan Navaie, Halim Yani...