Sciweavers

483 search results - page 93 / 97
» On perfectness of sums of graphs
Sort
View
ICWL
2004
Springer
14 years 25 days ago
Learning Algorithms with an Electronic Chalkboard over the Web
This paper describes a system for the animation of algorithms on an electronic chalkboard. The instructor teaching an algorithm can enter data directly through a drawing- the algor...
Margarita Esponda Argüero, Raúl Rojas
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot
BMCBI
2006
118views more  BMCBI 2006»
13 years 7 months ago
Low degree metabolites explain essential reactions and enhance modularity in biological networks
Background: Recently there has been a lot of interest in identifying modules at the level of genetic and metabolic networks of organisms, as well as in identifying single genes an...
Areejit Samal, Shalini Singh, Varun Giri, Sandeep ...
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel