1091 search results - page 202 / 219 » Approximation Algorithms for Data Placement Problems |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. One solution to the lack of label problem is to exploit transfer learning, whereby one acquires knowledge from source-domains to improve the learning performance in the t...
IMC
2007
ACM
13 years 9 months ago
2007
ACM
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
SSDBM
2010
IEEE
13 years 6 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
In many distributed environments, the primary function of monitoring software is to detect anomalies, that is, instances when system behavior deviates substantially from the norm....