3894 search results - page 383 / 779 » Approximation Algorithms for Biclustering Problems |
125
Voted
RECSYS
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
118
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
187
Voted
SWAT
2010
Springer
15 years 10 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
152
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
161
Voted
PODS
2003
ACM
16 years 5 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...