4908 search results - page 67 / 982 » On the Complexity of Optimal K-Anonymity |
219
click to vote
CVIU
2011
14 years 9 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
230
click to vote
TR
2010
15 years 26 days ago
2010
Software testing is an important issue in software engineering. As software systems become increasingly large and complex, the problem of how to optimally allocate the limited test...
196
click to vote
ALGORITHMICA
2011
14 years 9 months ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
174
click to vote
ICC
2009
IEEE
15 years 3 months ago
2009
IEEE
Receive antenna selection (AS) reduces the hardware complexity of multi-antenna receivers by dynamically connecting an instantaneously best antenna element to the available radio ...
189
click to vote
SIGIR
2012
ACM
13 years 8 months ago
2012
ACM
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...