Sciweavers

402 search results - page 53 / 81
» Cryptosystems using Linear Groups
Sort
View
GLOBECOM
2008
IEEE
14 years 10 months ago
Many-to-Many Traffic Grooming in WDM Mesh Networks
In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. Th...
Mohammad A. Saleh, Ahmed E. Kamal
HPCN
1997
Springer
15 years 2 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
ISBI
2004
IEEE
15 years 10 months ago
Towards a Shape Model of White Matter Fiber Bundles Using Diffusion Tensor MRI
White matter fiber bundles of the human brain form a spatial pattern defined by the anatomical and functional architecture. Human brain atlases provide names for individual tracts...
Isabelle Corouge, Guido Gerig, Sylvain Gouttard
INFOCOM
2008
IEEE
15 years 4 months ago
SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwa...
CADE
2002
Springer
15 years 10 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg