4908 search results - page 766 / 982 » On the Complexity of Optimal K-Anonymity |
154
click to vote
WABI
2007
Springer
16 years 21 days ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
160
click to vote
WAIM
2007
Springer
16 years 21 days ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
181
click to vote
WEBI
2007
Springer
16 years 21 days ago
2007
Springer
There is a critical need to design and develop tools tract away the fundamental complexity of XML-based Web services specifications and toolkits, and provide an elegant, intuitive...
165
click to vote
WINE
2007
Springer
16 years 21 days ago
2007
Springer
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search eng...
169
click to vote
3DPVT
2006
IEEE
16 years 20 days ago
2006
IEEE
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....