Sciweavers

382 search results - page 46 / 77
» Proof Theory for Distributed Knowledge
Sort
View
CP
2004
Springer
14 years 1 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
EOR
2008
90views more  EOR 2008»
13 years 8 months ago
Quality of service statistics over heterogeneous networks: Analysis and applications
Heterogeneous wireless/wired networks and ubiquitous environments are gaining ever more attention by research community. To properly control and manage such puzzles a deep knowled...
Alessio Botta, Antonio Pescapè, Giorgio Ven...
FOCS
2009
IEEE
14 years 3 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
CORR
2011
Springer
196views Education» more  CORR 2011»
13 years 8 days ago
Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
Michael T. Goodrich, Florian Kerschbaum
COMCOM
2008
120views more  COMCOM 2008»
13 years 8 months ago
Game theoretic models for detecting network intrusions
In this paper, we study using game theory the problem of detecting intrusions in wired infrastructure networks. Detection is accomplished by sampling a subset of the transmitted p...
Hadi Otrok, Mona Mehrandish, Chadi Assi, Mourad De...