16188 search results - page 160 / 3238 » The Optimal PAC Algorithm |
166
click to vote
ICSOC
2009
Springer
15 years 2 months ago
2009
Springer
With increasingly complex and heterogeneous systems in pervasive service computing, it becomes more and more important to provide self-protected services to end users. In order to ...
148
click to vote
CORR
2011
Springer
15 years 11 hour ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
138
click to vote
ANCS
2007
ACM
15 years 9 months ago
2007
ACM
Due to the advantages of easy re-configurability and scalability, the memory-based string matching architecture is widely adopted by network intrusion detection systems (NIDS). In...
122
Voted
COMGEO
2008
ACM
15 years 5 months ago
2008
ACM
A randomized linear expected-time algorithm for computing the zonoid depth (Dyckerhoff et al 1996, Mosler 2002) of a point with respect to a fixed dimensional point set is presente...
118
Voted
ISCAS
2006
IEEE
15 years 11 months ago
2006
IEEE
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...