121 search results - page 20 / 25 » Improving branch-and-cut performance by random sampling |
MCS
2000
Springer
15 years 2 months ago
2000
Springer
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
NAA
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
MCS
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. In adversarial classification tasks like spam filtering, intrusion detection in computer networks and biometric authentication, a pattern recognition system must not only...
IACR
2011
13 years 10 months ago
2011
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
CCS
2008
ACM
15 years 15 days ago
2008
ACM
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...