Sciweavers

12825 search results - page 1919 / 2565
» Improved PLSOM algorithm
Sort
View
ICANN
2007
Springer
15 years 11 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
ASPDAC
2006
ACM
125views Hardware» more  ASPDAC 2006»
15 years 11 months ago
Efficient identification of multi-cycle false path
Due to false paths and multi-cycle paths in a circuit, using only topological delay to determine the clock period could be too conservative. In this paper, we address the timing a...
Kai Yang, Kwang-Ting Cheng
DATE
2004
IEEE
116views Hardware» more  DATE 2004»
15 years 11 months ago
A Novel SAT All-Solutions Solver for Efficient Preimage Computation
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...
Bin Li, Michael S. Hsiao, Shuo Sheng
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
15 years 11 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
15 years 11 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
« Prev « First page 1919 / 2565 Last » Next »