549 search results - page 105 / 110 » On the Complexity of Restricted k-anonymity Problem |
ICGI
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
100
click to vote
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
175
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
VIS
2004
IEEE
15 years 11 months ago
2004
IEEE
ImageSurfer is a tool designed to explore correlations between two 3D scalar fields. Our scientific goal was to determine where a protein is located, and how much its concentratio...
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
As an indispensable technique in the field of Information Filtering, Recommender System has been well studied and developed both in academia and in industry recently. However, mo...