4908 search results - page 356 / 982 » On the Complexity of Optimal K-Anonymity |
171
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
171
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The identification and characterization of genes that influence the risk of common, complex multifactorial disease primarily through interactions with other genes and ...
184
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulatio...
209
click to vote
JAIR
2007
15 years 6 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...