4908 search results - page 959 / 982 » On the Complexity of Optimal K-Anonymity |
108
Voted
NIPS
1997
15 years 1 months ago
1997
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
NIPS
1997
15 years 1 months ago
1997
A Lyapunov function for excitatory-inhibitory networks is constructed. The construction assumes symmetric interactions within excitatory and inhibitory populations of neurons, and...
120
click to vote
UAI
1997
15 years 1 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
125
click to vote
WSC
1997
15 years 1 months ago
1997
Effective operational control of a manufacturing system that has routing flexibility is dependent upon being able to make informed real-time decisions in the event of a system dis...
IJCAI
1993
15 years 1 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...