2517 search results - page 19 / 504 » Specifying Weak Sets |
COCOON
2004
Springer
14 years 3 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
WINE
2007
Springer
14 years 3 months ago
2007
Springer
We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a well...
ASIACRYPT
2010
Springer
13 years 7 months ago
2010
Springer
We study security amplification for weak bit-commitment schemes and improve the efficiency of (black-box) transformations in both the information-theoretic and computational setti...
IJAR
2008
13 years 9 months ago
2008
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
ASPLOS
2011
ACM
13 years 1 months ago
2011
ACM
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...