Sciweavers

1464 search results - page 119 / 293
» On optimal anonymization for l -diversity
Sort
View
CCS
2009
ACM
16 years 7 months ago
Efficient IRM enforcement of history-based access control policies
Inlined Reference Monitor (IRM) is an established enforcement mechanism for history-based access control policies. IRM enforcement injects monitoring code into the binary of an un...
Fei Yan, Philip W. L. Fong
DAC
2005
ACM
16 years 7 months ago
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design
As the d esig n-m anu factu ring interface becom es increasing ly com plicated with IC technolog y scaling , the correspond ing process variability poses g reat challeng es for na...
Yang Xu, Kan-Lin Hsiung, Xin Li, Ivan Nausieda, St...
ICIP
2003
IEEE
16 years 8 months ago
The improved SP frame coding technique for the JVT standard
An efficient and flexible coding technique is proposed in this paper inspired by the SP frame in the H.26L standard, which can achieve a drift-free bitstream switching at the pred...
Xiaoyan Sun, Shipeng Li, Feng Wu, Jacky Shen, Wen ...
HPCA
2009
IEEE
16 years 7 months ago
Dynamic hardware-assisted software-controlled page placement to manage capacity allocation and sharing within large caches
In future multi-cores, large amounts of delay and power will be spent accessing data in large L2/L3 caches. It has been recently shown that OS-based page coloring allows a non-uni...
Manu Awasthi, Kshitij Sudan, Rajeev Balasubramonia...
WG
2007
Springer
16 years 17 days ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey