1512 search results - page 277 / 303 » connection 2006 |
KDD
2006
ACM
16 years 6 days ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
KDD
2006
ACM
16 years 6 days ago
2006
ACM
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
KDD
2006
ACM
16 years 6 days ago
2006
ACM
Abstract. In this paper we present static and dynamic studies of duplicate and near-duplicate documents in the Web. The static and dynamic studies involve the analysis of similar c...
103
Voted
STOC
2006
ACM
16 years 3 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
STOC
2006
ACM
16 years 3 days ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...