1464 search results - page 113 / 293 » On optimal anonymization for l -diversity |
312
click to vote
ISCA
2012
IEEE
13 years 9 months ago
2012
IEEE
Most modern cores perform a highly-associative translation look aside buffer (TLB) lookup on every memory access. These designs often hide the TLB lookup latency by overlapping it...
203
click to vote
ACMMSP
2006
ACM
16 years 13 days ago
2006
ACM
A blossoming paradigm for block-recursive matrix algorithms is presented that, at once, attains excellent performance measured by • time, • TLB misses, • L1 misses, • L2 m...
157
click to vote
TC
1998
15 years 6 months ago
1998
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
176
click to vote
CISS
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper considers broadcast channels with L antennas at the base station and m single-antenna users, where each user has perfect channel knowledge and the base station obtains c...
191
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...