Sciweavers

704 search results - page 70 / 141
» Learning the Ideal Evaluation Function
Sort
View
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
14 years 2 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
MICCAI
1999
Springer
14 years 2 months ago
Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation
Interpolation is required in many medical image processing operations. From sampling theory, it follows that the ideal interpolation kernel is the sinc function, which is of infin...
Erik H. W. Meijering, Wiro J. Niessen, Josien P. W...
CASES
2010
ACM
13 years 8 months ago
Fine-grain dynamic instruction placement for L0 scratch-pad memory
We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm ca...
JongSoo Park, James D. Balfour, William J. Dally
OSN
2011
13 years 5 months ago
Performance modeling of HS-RR-TCP over load-balanced optical burst-switched (OBS) networks
TCP-over-OBS is a promising transport paradigm to support next-generation Internet. It is well-known that loadbalanced routing generally improves loss performance over OBS. We ide...
Neal Charbonneau, Vinod Vokkarane
JMLR
2006
132views more  JMLR 2006»
13 years 10 months ago
Learning to Detect and Classify Malicious Executables in the Wild
We describe the use of machine learning and data mining to detect and classify malicious executables as they appear in the wild. We gathered 1,971 benign and 1,651 malicious execu...
Jeremy Z. Kolter, Marcus A. Maloof