Sciweavers

54 search results - page 11 / 11
» Computing symmetric rank for symmetric tensors
Sort
View
WG
2010
Springer
13 years 3 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 5 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
FC
2007
Springer
125views Cryptology» more  FC 2007»
13 years 11 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
PODC
2010
ACM
13 years 9 months ago
On asymmetric progress conditions
Wait-freedom and obstruction-freedom have received a lot of attention in the literature. These are symmetric progress conditions in the sense that they consider all processes as b...
Damien Imbs, Michel Raynal, Gadi Taubenfeld