Sciweavers

37 search results - page 8 / 8
» Computer-mediated communication: what can we learn from a di...
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 11 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
14 years 6 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo