Sciweavers

16430 search results - page 513 / 3286
» On Computable Tree Functions
Sort
View
TJS
2010
182views more  TJS 2010»
15 years 5 months ago
A novel unsupervised classification approach for network anomaly detection by k-Means clustering and ID3 decision tree learning
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
Yasser Yasami, Saadat Pour Mozaffari
DAC
2009
ACM
16 years 8 months ago
BDD-based synthesis of reversible logic for large functions
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-pow...
Robert Wille, Rolf Drechsler
193
Voted
SMA
2003
ACM
154views Solid Modeling» more  SMA 2003»
16 years 8 days ago
Discretization of functionally based heterogeneous objects
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
Elena Kartasheva, Valery Adzhiev, Alexander A. Pas...
EUROCRYPT
2006
Springer
15 years 10 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier
CGF
2008
99views more  CGF 2008»
15 years 7 months ago
Polyhedral Finite Elements Using Harmonic Basis Functions
Finite element simulations in computer graphics are typically based on tetrahedral or hexahedral elements, which enables simple and efficient implementations, but in turn requires...
Sebastian Martin, Peter Kaufmann, Mario Botsch, Ma...