Sciweavers

1302 search results - page 74 / 261
» On the Strong Chromatic Number
Sort
View
PODC
2010
ACM
15 years 6 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
CPC
2000
93views more  CPC 2000»
15 years 6 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount
JCT
2010
112views more  JCT 2010»
15 years 4 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
JMLR
2010
194views more  JMLR 2010»
15 years 1 months ago
A Statistical Implicative Analysis Based Algorithm and MMPC Algorithm for Detecting Multiple Dependencies
Discovering the dependencies among the variables of a domain from examples is an important problem in optimization. Many methods have been proposed for this purpose, but few large...
Elham Salehi, Jayashree Nyayachavadi, Robin Gras
IPMU
2010
Springer
15 years 11 months ago
Independent Natural Extension
We introduce a general definition for the independence of a number of finite-valued variables, based on coherent lower previsions. Our definition has an epistemic flavour: it a...
Gert de Cooman, Enrique Miranda, Marco Zaffalon