1464 search results - page 96 / 293 » On optimal anonymization for l -diversity |
174
click to vote
ATMOS
2008
15 years 8 months ago
2008
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their traffic rates (frequencies) in an underlying railway network infrastruct...
191
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
196
click to vote
COCO
1994
Springer
15 years 10 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
169
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
186
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The problem of reliable communication over unknown frequency-selective block-fading channels with sparse impulse responses is considered. In particular, discrete-time impulse respo...