Sciweavers

2252 search results - page 212 / 451
» Improving Random Forests
Sort
View
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
WINE
2007
Springer
193views Economy» more  WINE 2007»
15 years 10 months ago
Auctions with Revenue Guarantees for Sponsored Search
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
Zoë Abrams, Arpita Ghosh
FOCS
2006
IEEE
15 years 10 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
INFOCOM
2006
IEEE
15 years 10 months ago
Analyzing the Receiver Window Modification Scheme of TCP Queues
– Explicit Congestion Notification (ECN) and Active Queue Management (AQM) Schemes such as Random Early Detection (RED), Adaptive Random Early Detection (ARED) and BLUE queues ha...
Visvasuresh Victor Govindaswamy, Gergely V. Z&aacu...
INFOCOM
2006
IEEE
15 years 10 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...