Sciweavers

4581 search results - page 204 / 917
» Computing Transformation Semigroups
Sort
View
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
16 years 20 days ago
On the Necessity of Rewinding in Secure Multiparty Computation
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
Michael Backes, Jörn Müller-Quade, Domin...
EUSAI
2003
Springer
15 years 11 months ago
Interaction Design for the Disappearing Computer
This invited talk starts out with a review of the previously developed Roomware® concept and sample prototypes as an approach for designing new forms of interaction and collaborat...
Norbert A. Streitz
WSC
2004
15 years 8 months ago
Simulating Availability Outlook for E-Commerce Business of Personal Computer Sales
For newly designed or transformed business processes, accurately predicting business performances such as costs and customer services before actual deployment is very important. W...
Young M. Lee
IANDC
2007
117views more  IANDC 2007»
15 years 6 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 6 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler