Fork bomb

Known as: Rabbit virus, Fork while fork, Bacteria 
In computing, a fork bomb (also called rabbit virus or wabbit) is a denial-of-service attack wherein a process continually replicates itself to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2001-2017
02420012017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A fork bomb attack is a denial of service attack. An attacker generates many processes rapidly, exhausting the resources of the… (More)
  • table 2
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2015
2015
In a global market the capacity to mine and analyze user data is one way for companies to be as close in time and accuracy to the… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2015
2015
Regularized logistic regression is a very useful classification method, but for large-scale data, its distributed training has… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
This work provides simple algorithms for multiclass (and multi-label) prediction in settings where both the number of examples n… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Bootstrapping is a useful technique for estimating the uncertainty of a predictor, for example, confidence intervals for… (More)
  • figure 1
  • figure 3
  • table 1
  • table 2
Is this relevant?
2013
2013
We demonstrate "Dr. Horrible's Fork Bomb", a CS2 lab assignment we have developed for teaching security issues in C/C++ as well… (More)
Is this relevant?
2012
2012
Linear classification has demonstrated success in many areas of applications. Modern algorithms for linear classification can… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In this paper, we first demonstrate that b-bit minwise hashing, whose estimators are positive definite kernels, can be naturally… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
We employ static analysis to examine monotonicity of functions defined over lattices in a λ-calculus augmented with constants… (More)
Is this relevant?