4908 search results - page 822 / 982 » On the Complexity of Optimal K-Anonymity |
213
click to vote
IKE
2003
15 years 7 months ago
2003
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
177
click to vote
UAI
2004
15 years 7 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
173
click to vote
VMV
2004
15 years 7 months ago
2004
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...
111
click to vote
WSC
2004
15 years 7 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
164
click to vote
AAAI
1997
15 years 7 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...