Cryptographic Service Provider

Known as: CSP 
In Microsoft Windows, a Cryptographic Service Provider (CSP) is a software library that implements the Microsoft CryptoAPI (CAPI). CSPs implement… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Common spatial pattern (CSP) is a popular algorithm for classifying electroencephalogram (EEG) signals in the context of brain… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
As peer-to-peer (P2P) emerges as a major paradigm for scalable network application design, it also exposes significant new… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper presents a new algorithm for solving distributed constraint satisfaction problems (distributed CSPs) called the… (More)
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
A constraint satisfaction problem (CSP) requires a value, selected from a given ®nite domain, to be assigned to each variable in… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Filtering techniques are essential in order to ef ciently solve constraint satisfaction problems CSPs A blind search often leads… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Constraint networks are used more and more to solve combinatorial problems in real-life applications. Much activity is… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Abs t rac t . We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric… (More)
Is this relevant?