7015 search results - page 1180 / 1403 » Approximation algorithms for co-clustering |
167
click to vote
FAST
2004
15 years 5 months ago
2004
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...
148
click to vote
IPCO
2004
15 years 5 months ago
2004
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
172
click to vote
WCE
2007
15 years 5 months ago
2007
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
155
click to vote
ICA
2010
Springer
15 years 4 months ago
2010
Springer
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
139
click to vote
SIGIR
2010
ACM
15 years 4 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...