Sciweavers

1243 search results - page 239 / 249
» Generating Trees on Multisets
Sort
View
CCS
2008
ACM
14 years 11 months ago
Securing group key exchange against strong corruptions
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
Emmanuel Bresson, Mark Manulis
CSCLP
2008
Springer
14 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
FC
2008
Springer
90views Cryptology» more  FC 2008»
14 years 11 months ago
Practical Anonymous Divisible E-Cash from Bounded Accumulators
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unl...
Man Ho Au, Willy Susilo, Yi Mu
DAGSTUHL
2010
14 years 11 months ago
CSG Operations of Arbitrary Primitives with Interval Arithmetic and Real-Time Ray Casting
We apply Knoll et al.'s algorithm [9] to interactively ray-cast constructive solid geometry (CSG) objects of arbitrary primitives represented as implicit functions. Whereas m...
Younis Hijazi, Aaron Knoll, Mathias Schott, Andrew...
EMNLP
2007
14 years 11 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner