1207 search results - page 226 / 242 » On distributed optimization using generalized gossip |
165
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
130
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
228
Voted
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
181
click to vote
ALT
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
159
Voted
VEE
2009
ACM
15 years 10 months ago
2009
ACM
Many data center virtualization solutions, such as VMware ESX, employ content-based page sharing to consolidate the resources of multiple servers. Page sharing identifies virtual...