Sciweavers

12825 search results - page 123 / 2565
» Improved PLSOM algorithm
Sort
View
ACSD
2005
IEEE
90views Hardware» more  ACSD 2005»
15 years 10 months ago
Improved Decomposition of STGs
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
Walter Vogler, Ben Kangsah
ANSS
2005
IEEE
15 years 10 months ago
The Bubble Bit Technique as Improvement of HDL-Based Quantum Circuits Simulation
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...
Mihai Udrescu, Lucian Prodan, Mircea Vladutiu
WISE
2005
Springer
15 years 10 months ago
Improving Web Data Annotations with Spreading Activation
The Web has established itself as the largest public data repository ever available. Even though the vast majority of information on the Web is formatted to be easily readable by t...
Fatih Gelgi, Srinivas Vadrevu, Hasan Davulcu
ICBA
2004
Springer
144views Biometrics» more  ICBA 2004»
15 years 10 months ago
Improving Iris Recognition Accuracy via Cascaded Classifiers
As a reliable approach to human identification, iris recognition has received increasing attention in recent years. In the literature of iris recognition, local feature of image de...
Zhenan Sun, Yunhong Wang, Tieniu Tan, Jiali Cui
SAT
2004
Springer
89views Hardware» more  SAT 2004»
15 years 10 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva