4908 search results - page 96 / 982 » On the Complexity of Optimal K-Anonymity |
225
click to vote
JMLR
2012
13 years 8 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
192
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
196
click to vote
VIS
2008
IEEE
16 years 7 months ago
2008
IEEE
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
164
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
282
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. The...