Matches in ScholarlyData for { ?s ?p ?o. }
- item-4 type ListItem.
- item-4 hasContent shaul-markovitch.
- item-4 previous item-3.
- adaptive-policies-for-selecting-groupon-style-chun creator dinesh-garg.
- adaptive-policies-for-selecting-groupon-style-chun creator michael-grabchak.
- adaptive-policies-for-selecting-groupon-style-chun creator narayan-bhamidipati.
- adaptive-policies-for-selecting-groupon-style-chun creator rushi-bhatt.
- adaptive-policies-for-selecting-groupon-style-chun type InProceedings.
- adaptive-policies-for-selecting-groupon-style-chun label "Adaptive Policies for Selecting Groupon Style Chunked Reward Ads in a Stochastic Knapsack Framework".
- adaptive-policies-for-selecting-groupon-style-chun sameAs adaptive-policies-for-selecting-groupon-style-chun.
- adaptive-policies-for-selecting-groupon-style-chun abstract "Stochastic knapsack problems deal with selecting items with potentially random sizes and rewards so as to maximize the total reward while satisfying certain capacity constraints. A novel variant of this problem, where items are worthless unless collected in bundles, is introduced here. This setup is similar to the Groupon model, where a deal is off unless a minimum number of users sign up for it. Since the optimal algorithm to solve this problem is not practical, several adaptive greedy approaches with reasonable time and memory requirements are studied in detail -- theoretically, as well as, experimentally. Worst case performance guarantees are provided for some of these greedy algorithms, while results of experimental evaluation demonstrate that they are much closer to optimal than what the theoretical bounds suggest. Applications include optimizing for online advertising pricing models where advertisers pay only when certain goals, in terms of clicks or conversions, are met. We perform extensive experiments for the situation where there are between two and five ads. For typical ad conversion rates, the greedy policy of selecting items having the highest individual expected reward obtains a value within 5% of optimal over 95% of the time for a wide selection of parameters.".
- adaptive-policies-for-selecting-groupon-style-chun hasAuthorList authorList.
- adaptive-policies-for-selecting-groupon-style-chun hasTopic monetization.
- adaptive-policies-for-selecting-groupon-style-chun hasTopic World_Wide_Web.
- adaptive-policies-for-selecting-groupon-style-chun isPartOf proceedings.
- adaptive-policies-for-selecting-groupon-style-chun title "Adaptive Policies for Selecting Groupon Style Chunked Reward Ads in a Stochastic Knapsack Framework".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent michael-grabchak.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent narayan-bhamidipati.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent rushi-bhatt.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent dinesh-garg.
- item-4 previous item-3.
- addressing-peoples-information-needs-directly-in-a creator jaime-teevan.
- addressing-peoples-information-needs-directly-in-a creator lydia-b-chilton.
- addressing-peoples-information-needs-directly-in-a type InProceedings.
- addressing-peoples-information-needs-directly-in-a label "Addressing People's Information Needs Directly in a Web Search Result Page".
- addressing-peoples-information-needs-directly-in-a sameAs addressing-peoples-information-needs-directly-in-a.
- addressing-peoples-information-needs-directly-in-a abstract "Web search engines have historically focused on connecting people with information resources. For example, if a person wanted to know when their flight to Hyderabad was leaving, a search engine might connect them with the airline where they could find flight status information. However, search engines have recently begun to try to meet people s search needs directly, providing, for example, flight status information in response to queries that include an airline and a flight number. In this paper, we use large scale query log analysis to explore the challenges a search engine faces when trying to meet an information need directly in the search result page. We look at how people's interaction behavior changes when inline content is returned, finding that such content can cannibalize clicks from the algorithmic results. We see that in the absence of interaction behavior, an individual's repeat search behavior can be useful in understanding the content's value. We also discuss some of the ways user behavior can be used to provide insight into when inline answers might better trigger and what types of additional information might be included in the results.".
- addressing-peoples-information-needs-directly-in-a hasAuthorList authorList.
- addressing-peoples-information-needs-directly-in-a hasTopic intent-understanding.
- addressing-peoples-information-needs-directly-in-a hasTopic World_Wide_Web.
- addressing-peoples-information-needs-directly-in-a isPartOf proceedings.
- addressing-peoples-information-needs-directly-in-a title "Addressing People's Information Needs Directly in a Web Search Result Page".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent lydia-b-chilton.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jaime-teevan.
- item-2 previous item-1.
- an-expressive-mechanism-for-auctions-on-the-web creator ingmar-weber.
- an-expressive-mechanism-for-auctions-on-the-web creator monika-henzinger.
- an-expressive-mechanism-for-auctions-on-the-web creator paul-duetting.
- an-expressive-mechanism-for-auctions-on-the-web type InProceedings.
- an-expressive-mechanism-for-auctions-on-the-web label "An Expressive Mechanism for Auctions on the Web".
- an-expressive-mechanism-for-auctions-on-the-web sameAs an-expressive-mechanism-for-auctions-on-the-web.
- an-expressive-mechanism-for-auctions-on-the-web abstract "Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the limited expressiveness that they offer to the bidders. The General Auction Mechanism (GAM) of Aggarwal et al. (2009) is taking a first step towards addressing the problem of limited expressiveness by computing a bidder optimal, envy free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair. We show that in many practical situations this does not suffice to adequately model the preferences of the bidders, and we overcome this problem by presenting the first mechanism for piece-wise linear utility functions with non-identical slopes and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM it is incentive compatible for inputs that fulfill a certain non-degeneracy requirement, but our requirement is more general than the requirement of GAM. For discontinuous utility functions that are non-degenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium. We also show how our mechanism can be used to compute approximately bidder optimal, envy free outcomes for a general class of continuous utility functions via piece-wise linear approximation. Finally, we prove hardness results for even more expressive settings.".
- an-expressive-mechanism-for-auctions-on-the-web hasAuthorList authorList.
- an-expressive-mechanism-for-auctions-on-the-web hasTopic monetization.
- an-expressive-mechanism-for-auctions-on-the-web hasTopic World_Wide_Web.
- an-expressive-mechanism-for-auctions-on-the-web isPartOf proceedings.
- an-expressive-mechanism-for-auctions-on-the-web title "An Expressive Mechanism for Auctions on the Web".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent paul-duetting.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent monika-henzinger.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ingmar-weber.
- item-3 previous item-2.
- arrow-generating-signatures-to-detect-drive-by-dow creator christian-seifert.
- arrow-generating-signatures-to-detect-drive-by-dow creator jack-w-stokes.
- arrow-generating-signatures-to-detect-drive-by-dow creator junjie-zhang.
- arrow-generating-signatures-to-detect-drive-by-dow creator wenke-lee.
- arrow-generating-signatures-to-detect-drive-by-dow type InProceedings.
- arrow-generating-signatures-to-detect-drive-by-dow label "ARROW: GenerAting SignatuRes to Detect DRive-By DOWnloads".
- arrow-generating-signatures-to-detect-drive-by-dow sameAs arrow-generating-signatures-to-detect-drive-by-dow.
- arrow-generating-signatures-to-detect-drive-by-dow abstract "A drive-by download attack occurs when a user visits a webpage which attempts to automatically download malware without the user's consent. Attackers sometimes use a malware distribution network (MDN) to manage a large number of malicious webpages, exploits, and malware executables. In this paper, we provide a new method to determine these MDNs from the secondary URLs and redirect chains recorded by a high-interaction client honeypot. In addition, we propose a novel drive-by download detection method. Instead of depending on the malicious content used by previous methods, our algorithm first identifies and then leverages the URLs of the MDN's central servers, where a central server is a common server shared by a large percentage of the drive-by download attacks in the same MDN. A set of regular expression-based signatures are then generated based on the URLs of each central server. This method allows additional malicious webpages to be identified which launched but failed to execute a successful drive-by download attack. The new drive-by detection system named ARROW has been implemented, and we provide a large-scale evaluation on the output of a production drive-by detection system. The experimental results demonstrate the effectiveness of our method, where the detection coverage has been boosted by 96% with an extremely low false positive rate.".
- arrow-generating-signatures-to-detect-drive-by-dow hasAuthorList authorList.
- arrow-generating-signatures-to-detect-drive-by-dow hasTopic web-security.
- arrow-generating-signatures-to-detect-drive-by-dow hasTopic World_Wide_Web.
- arrow-generating-signatures-to-detect-drive-by-dow isPartOf proceedings.
- arrow-generating-signatures-to-detect-drive-by-dow title "ARROW: GenerAting SignatuRes to Detect DRive-By DOWnloads".