Sciweavers

29046 search results - page 207 / 5810
» Computable Models
Sort
View
150
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
134
Voted
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 3 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
ASIACRYPT
2008
Springer
15 years 5 months ago
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tart...
122
Voted
JLP
2007
81views more  JLP 2007»
15 years 3 months ago
Service oriented computing from a process algebraic perspective
Service Oriented Computing is emerging as a reference model for a new class of distributed computing technologies such as Web Services and the Grid. We discuss three main aspects ...
Mario Bravetti, Gianluigi Zavattaro
157
Voted
TIME
2006
IEEE
15 years 9 months ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov