4908 search results - page 736 / 982 » On the Complexity of Optimal K-Anonymity |
180
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
303
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
201
click to vote
ASIAMS
2009
IEEE
16 years 1 months ago
2009
IEEE
Cognitive radio has the ability to sense the environment and adapt its behavior to optimize communication features, such as quality of service in the presence of interference and ...
186
click to vote
CBMS
2009
IEEE
16 years 1 months ago
2009
IEEE
Feature extraction and selection are two important steps for shape retrieval. Given a data set, a set of features which describe the shape property from different aspects are extr...
149
click to vote
ISQED
2009
IEEE
16 years 1 months ago
2009
IEEE
As technology advances, the interconnect delay among modules plays dominant role in chip performance. Buffer insertion, as a traditional approach to reduce wire delay in 2D ICs, i...