7200 search results - page 331 / 1440 » On the Computational Power of Winner-Take-All |
170
click to vote
RTA
2004
Springer
16 years 3 days ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
150
click to vote
SAC
1998
ACM
15 years 11 months ago
1998
ACM
This paper describes STL, a new coordination model and corresponding language. STL's power and expressiveness are shown through a preliminary distributed implementation of a ...
174
click to vote
FSS
2006
15 years 6 months ago
2006
Fuzzy integrals are commonly used as aggregation operators. In this paper we present new composite models based on fuzzy integrals with several t-conorms. These models permit to f...
151
click to vote
TCS
1998
15 years 6 months ago
1998
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
146
click to vote
CARDIS
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computa...