1403 search results - page 44 / 281 » Set cover algorithms for very large datasets |
CEAS
2006
Springer
14 years 7 days ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
ICIP
2009
IEEE
13 years 6 months ago
2009
IEEE
Gathering a large collection of images has been made quite easy by social and image sharing websites, e.g. flickr.com. However, using such collections faces the problem that they ...
ICDCS
2012
IEEE
11 years 11 months ago
2012
IEEE
—The Web 2.0 era is characterized by the emergence of a very large amount of live content. A real time and finegrained content filtering approach can precisely keep users upto-...
ACL
2008
13 years 10 months ago
2008
Frequency counts from very large corpora, such as the Web 1T dataset, have recently become available for language modeling. Omission of low frequency n-gram counts is a practical ...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...