9370 search results - page 83 / 1874 » An Abstract Notion of Application |
119
Voted
RSCTC
2004
Springer
15 years 6 months ago
2004
Springer
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
105
click to vote
IFIPTCS
2000
15 years 4 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
126
Voted
ICALT
2007
IEEE
15 years 7 months ago
2007
IEEE
How can game designers realize the balance of “educational function” and “entertainment” in a Computer-based Educational Game (CEG)? The concept of IMS learning design (LD...
118
click to vote
CISC
2007
Springer
15 years 6 months ago
2007
Springer
We formalize a generic method of constructing efficient group signatures, specifically, we define new notions of unlinkable randomizable signature, indirectly signable signature ...
115
Voted
ESA
2005
Springer
15 years 6 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...