Sciweavers

2983 search results - page 94 / 597
» The group marriage problem
Sort
View
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
15 years 5 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
98
Voted
IPL
2006
118views more  IPL 2006»
15 years 22 days ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
82
Voted
QEST
2006
IEEE
15 years 6 months ago
Modeling and Optimization Problems in Contact Centers
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
Pierre L'Ecuyer
87
Voted
ICC
2007
IEEE
126views Communications» more  ICC 2007»
15 years 7 months ago
Evaluation of Grouping Strategies for an Hierarchical SDMA/TDMA Scheduling Process
Abstract— Adding SDMA capabilities to modern wireless communication systems like IEEE 802.16 WiMAX promises high system capacity gains but raises the problem of combining orthogo...
Christian Hoymann, Jan Ellenbeck, Ralf Pabst, Marc...
ASIACRYPT
2009
Springer
15 years 7 months ago
Group Encryption: Non-interactive Realization in the Standard Model
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
Julien Cathalo, Benoît Libert, Moti Yung