Sciweavers

601 search results - page 54 / 121
» Simulation vs. Equivalence
Sort
View
LICS
1997
IEEE
14 years 24 days ago
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
David Janin
CSDA
2008
111views more  CSDA 2008»
13 years 9 months ago
Automatic bandwidth selection for circular density estimation
Given angular data 1, . . . , n [0, 2) a common objective is to estimate the density. In the case that a kernel estimator is used, bandwidth selection is crucial to the performan...
Charles C. Taylor
ENGL
2007
83views more  ENGL 2007»
13 years 9 months ago
Analysis of Hybrid Translinear Circuit and Its Application
—A hybrid translinear (TL) circuit constituted by two kinds of transistors, bipolar and CMOS transistors, was proposed to control its quiescent current. And a new method was intr...
Cheng Yuhua, Wu Xiaobo, Yan Xiaolang
NN
2008
Springer
13 years 9 months ago
Two k-winners-take-all networks with discontinuous activation functions
This paper presents two k-winners-take-all (k-WTA) networks with discontinuous activation functions. The k-WTA operation is first converted equivalently into linear and quadratic ...
Qingshan Liu, Jun Wang
FOSSACS
2011
Springer
13 years 22 days ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...