1207 search results - page 133 / 242 » Towards optimal k-anonymization |
201
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
190
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
181
click to vote
COMSUR
2011
14 years 6 months ago
2011
—In large networks, a data source may not reach the intended sink in a single hop, thereby requiring the traffic to be routed via multiple hops. An optimized choice of such rout...
221
click to vote
TKDE
2012
13 years 8 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
160
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
— High-end computing (HEC) systems have passed the petaflop barrier and continue to move toward the next frontier of exascale computing. As companies and research institutes con...