Sciweavers

78 search results - page 15 / 16
» Applications of Latent Class Analysis in Social Science Rese...
Sort
View
WWW
2009
ACM
14 years 11 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...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
APGV
2006
ACM
181views Visualization» more  APGV 2006»
14 years 4 months ago
Categorization of natural scenes: local vs. global information
Understanding the robustness and rapidness of human scene categorization has been a focus of investigation in the cognitive sciences over the last decades. At the same time, progr...
Julia Vogel, Adrian Schwaninger, Christian Wallrav...
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
14 years 4 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
AAAI
2006
14 years 9 days ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer