Sciweavers

1017 search results - page 125 / 204
» Some existence and construction results of polygonal designs
Sort
View
FOSSACS
2005
Springer
15 years 12 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
ASIACRYPT
2009
Springer
16 years 29 days ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
ATAL
2005
Springer
15 years 12 months ago
A scalable approach to multi-agent resource acquisition and control
Scalable coordination is a key challenge in deployment of multiagent systems. Resource usage is one part of agent behavior which naturally lends itself to abstraction. CyberOrgs i...
Nadeem Jamali, Xinghui Zhao
ACL
2010
15 years 4 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
SDM
2009
SIAM
154views Data Mining» more  SDM 2009»
16 years 3 months ago
AMORI: A Metric-Based One Rule Inducer.
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
Niklas Lavesson, Paul Davidsson