Sciweavers

417 search results - page 49 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
POPL
2007
ACM
14 years 9 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
WWW
2008
ACM
14 years 9 months ago
Externalities in online advertising
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
Arpita Ghosh, Mohammad Mahdian
ATAL
2006
Springer
14 years 24 days ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
WWW
2005
ACM
14 years 9 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
GLOBECOM
2008
IEEE
14 years 3 months ago
Robust Distributed Sensor Network Localization Based on Analysis of Flip Ambiguities
Abstract— A major problem in wireless sensor network localization is erroneous local geometric realizations in some parts of the network due to the sensitivity to certain distanc...
Anushiya A. Kannan, Baris Fidan, Guoqiang Mao