Sciweavers

402 search results - page 40 / 81
» Cryptosystems using Linear Groups
Sort
View
GLOBECOM
2009
IEEE
15 years 1 months ago
Design and Provisioning of WDM Networks for Many-to-Many Traffic Grooming
A large number of network applications today allow several users to interact together using the many-to-many service mode. A many-to-many session consists of group of users (we ref...
Mohammad A. Saleh, Ahmed E. Kamal
IPL
2002
74views more  IPL 2002»
14 years 9 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
15 years 1 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
NIPS
2007
14 years 11 months ago
Hierarchical Penalization
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hiera...
Marie Szafranski, Yves Grandvalet, Pierre Morizet-...
CONSTRAINTS
1999
120views more  CONSTRAINTS 1999»
14 years 9 months ago
Refined Inequalities for Stable Marriage
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...