Sciweavers

3250 search results - page 621 / 650
» An Algorithm to Solve a Linear Program
Sort
View
WWW
2009
ACM
14 years 9 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
WWW
2007
ACM
14 years 9 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
WWW
2005
ACM
14 years 9 months ago
Topic segmentation of message hierarchies for indexing and navigation support
Message hierarchies in web discussion boards grow with new postings. Threads of messages evolve as new postings focus within or diverge from the original themes of the threads. Th...
Jong Wook Kim, K. Selçuk Candan, Mehmet Emi...
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 8 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
14 years 3 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point