Sciweavers

3357 search results - page 399 / 672
» Controlling Complexity
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
DOCENG
2008
ACM
15 years 8 months ago
Configurable editing of XML-based variable-data documents
: Variable data documents can be considered as functions of their bindings to values, and this function could be arbitrarily complex to build strongly-customised but high-value doc...
John Lumley, Roger Gimson, Owen Rees
IE
2007
15 years 8 months ago
Two families: dynamical policy models in interactive storytelling
In this paper we introduce a mathematical model of conflict that enhances Richardson’s model of Arms Race accounting for interactive scenarios, such as the ones provided by CRP...
Fabio Zambetta, Adam Nash, Paul Smith
AGI
2008
15 years 8 months ago
Using Decision Trees to Model an Emotional Attention Mechanism
: There are several approaches to emotions in AI, most of which are inspired by human emotional states and their arousal mechanisms. These approaches usually use high-level models ...
Saman Harati Zadeh, Saeed Bagheri Shouraki, Ramin ...
CATS
2008
15 years 8 months ago
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...
Lindsay Groves