4908 search results - page 875 / 982 » On the Complexity of Optimal K-Anonymity |
218
click to vote
COMGEO
1999
ACM
15 years 6 months ago
1999
ACM
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
202
click to vote
TIP
1998
15 years 6 months ago
1998
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
167
click to vote
TSE
2002
15 years 6 months ago
2002
The complexity of hardware/software codesign of embedded real-time signal processing systems can be reduced by rapid system prototyping (RSP). However, existing RSP frameworks do n...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
For a family/sequence of Space-Time Block Codes (STBCs) C1, C2, . . . , with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use, i = 1, 2, . ....
196
click to vote
PVLDB
2008
15 years 5 months ago
2008
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...