5608 search results - page 88 / 1122 » On the Theory of Matchgate Computations |
ECSQARU
2007
Springer
15 years 7 months ago
2007
Springer
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
122
click to vote
BIRTHDAY
2008
Springer
15 years 3 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
119
click to vote
DLT
2003
15 years 2 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
151
click to vote
ECEASST
2010
14 years 11 months ago
2010
Abstract: An experiment in providing volunteer cloud computing support for automated audits of open source code is described here, along with the supporting theory. Certification a...
100
click to vote
ECCV
2000
Springer
16 years 3 months ago
2000
Springer
The Singular Value Decomposition (SVD) of a matrix is a linear algebra tool that has been successfully applied to a wide variety of domains. The present paper is concerned with the...