10412 search results - page 376 / 2083 » The efficiency of algorithms - misconceptions |
112
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
126
click to vote
CAP
2010
14 years 11 months ago
2010
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
167
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Packet Classification (PC) has been a critical data path function for many emerging networking applications. An interesting approach is the use of TCAM to achieve deterministic, hi...
127
click to vote
AUTOMATICA
2006
15 years 4 months ago
2006
The problem of absolute stability is one of the oldest open problems in the theory of control. Even for the particular case of second-order systems a complete solution was present...
143
click to vote
NECO
2008
15 years 4 months ago
2008
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...