4908 search results - page 675 / 982 » On the Complexity of Optimal K-Anonymity |
170
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
This paper presents a computational approach for the frequency-domain identification of multivariable, discrete-time transfer function models based on a cost function minimization...
188
Voted
ISCI
2007
15 years 6 months ago
2007
In an object-relational database management system, a query optimizer requires users to provide cost models of userdefined functions. The traditional approach is analytical, that...
167
click to vote
TOG
2008
15 years 6 months ago
2008
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
172
click to vote
TSP
2008
15 years 6 months ago
2008
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
150
click to vote
TSP
2008
15 years 6 months ago
2008
A subspace beamforming method is presented that decomposes a MIMO channel into multiple pairs of subchannels. The pairing is done based on singular values such that similar channel...