1403 search results - page 66 / 281 » Set cover algorithms for very large datasets |
111
click to vote
WAW
2004
Springer
15 years 3 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
APWEB
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Background: Databases containing very large amounts of SNP (Single Nucleotide Polymorphism) data are now freely available for researchers interested in medical and/or population g...
NIPS
2007
14 years 11 months ago
2007
Many existing approaches to collaborative filtering can neither handle very large datasets nor easily deal with users who have very few ratings. In this paper we present the Prob...
IFIP12
2007
14 years 11 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...