3096 search results - page 207 / 620 » Theory and Use of the EM Algorithm |
159
Voted
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
202
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
197
click to vote
COMPGEOM
2006
ACM
16 years 7 days ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
158
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
155
click to vote
VLSID
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...