Sciweavers

2735 search results - page 194 / 547
» Comparing notions of randomness
Sort
View
AAAI
2008
14 years 22 days ago
A New Incomplete Method for CSP Inconsistency Checking
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
Belaid Benhamou, Mohamed Réda Saïdi
ASIACRYPT
2008
Springer
14 years 12 days ago
Ambiguous Optimistic Fair Exchange
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Su...
ICALP
2010
Springer
14 years 11 days ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...
EUSFLAT
2007
132views Fuzzy Logic» more  EUSFLAT 2007»
13 years 12 months ago
Shortfall-dependant Risk Measures (and Previsions)
Because of their simplicity, risk measures are often employed in financial risk evaluations and related decisions. In fact, the risk measure ρ(X) of a random variable X is a rea...
Pietro Baroni, Renato Pelessoni, Paolo Vicig
SDM
2007
SIAM
73views Data Mining» more  SDM 2007»
13 years 11 months ago
Sketching Landscapes of Page Farms
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
Bin Zhou 0002, Jian Pei