Caret

Known as: Caret insertion point, , Hat symbol 
The caret /ˈkærᵻt/ is an inverted V-shaped grapheme. It is the spacing character ^ in ASCII (at code point 5Ehex) and other character sets that may… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1964-2017
024619642017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The number of malware is growing significantly fast. Traditional malware detectors based on signature matching or code emulation… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2017
2017
CARET (A temporal logic of calls and returns) was introduced by Alur et al. This logic allows to write linear temporal logic… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We evaluate 179 classifiers arising from 17 families (discriminant analysis, Bayesian, neural networks, support vector machines… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
2013
2013
We present our design exploration in the area of virtual stick controllers and a preliminary evaluation in an editing task… (More)
Is this relevant?
2013
2013
Artificial night lights pose a major threat to multiple species. However, this threat is often disregarded in conservation… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2009
2009
We study the extension of the full logic CaRet with the unary regular modality N (which reads “from now on”) which allows to… (More)
  • figure 1
Is this relevant?
2009
2009
To optimize tuning parameters of models, train can be used to fit many predictive models over a grid of parameters and return the… (More)
  • table 1
  • table 1
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2007
2007
Variable importance evaluation functions can be separated into two groups: those that use the model information and those that do… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper gives an algorithm for solving linear programming problems. For a problem with n constraints and d variables, the… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We introduce the visibility complex of a collection<inline-equation><f><sc>O</sc></f></inline-equation> of <?Pub Fmt italic>n… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?