Sciweavers

401 search results - page 24 / 81
» Random Early Marking
Sort
View
145
Voted
ESANN
2006
15 years 1 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
TSMC
2011
228views more  TSMC 2011»
14 years 7 months ago
Privacy-Preserving Outlier Detection Through Random Nonlinear Data Distortion
— Consider a scenario in which the data owner has some private/sensitive data and wants a data miner to access it for studying important patterns without revealing the sensitive ...
Kanishka Bhaduri, Mark D. Stefanski, Ashok N. Sriv...
IPPS
1998
IEEE
15 years 4 months ago
Randomization in Parallel Stringology
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
S. Muthukrishnan
TIT
2002
63views more  TIT 2002»
15 years 1 days ago
Fibonacci and Galois representations of feedback-with-carry shift registers
Feedback with carry shift registers (FCSRs) are a class of finite state devices that are similar to linear feedback shift registers (LFSRs) in their simplicity and statistical ran...
Mark Goresky, Andrew Klapper
INFOCOM
2000
IEEE
15 years 4 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...