Sciweavers

2354 search results - page 448 / 471
» Randomness, Stochasticity and Approximations
Sort
View
SIGECOM
2011
ACM
170views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Only valuable experts can be valued
Suppose a principal Alice wishes to reduce her uncertainty regarding some future payoff. Consider a self-proclaimed expert Bob that may either be an informed expert knowing an ex...
Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert...
WWW
2007
ACM
14 years 8 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 8 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 8 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan