Sciweavers

1279 search results - page 203 / 256
» Fast Implementations of Automata Computations
Sort
View
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 10 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
SETP
2007
13 years 10 months ago
Dimensional Inference Using Symbol Lives
Scientific equations embedded in computer programs must obey the rules for dimensional consistency. Many efforts have been made to enforce these rules within computer programs. So...
Brian Farrimond, John Collins
WSCG
2001
124views more  WSCG 2001»
13 years 10 months ago
Occlusion Evaluation in Hierarchical Radiosity
In any hierarchical radiosity method, the most expensive part is the evaluation of the visibility. Many methods use sampling and ray casting to determine this term. Space partitio...
Yann Dupuy, Mathias Paulin, René Caubet
ICISC
1998
87views Cryptology» more  ICISC 1998»
13 years 10 months ago
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
Detlef Hühnlein, Andreas Meyer, Tsuyoshi Taka...
NECO
2008
108views more  NECO 2008»
13 years 8 months ago
An SMO Algorithm for the Potential Support Vector Machine
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...
Tilman Knebel, Sepp Hochreiter, Klaus Obermayer