Sciweavers

2446 search results - page 370 / 490
» Choiceless Polynomial Time
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Learning to impersonate
Consider Alice, who is interacting with Bob. Alice and Bob have some shared secret which helps Alice identify Bob-impersonators. Now consider Eve, who knows Alice and Bob, but doe...
Moni Naor, Guy N. Rothblum
SIGSOFT
2004
ACM
14 years 8 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
ICDT
2009
ACM
150views Database» more  ICDT 2009»
14 years 8 months ago
Optimizing user views for workflows
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
Olivier Biton, Susan B. Davidson, Sanjeev Khanna, ...
WWW
2009
ACM
14 years 8 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
WWW
2009
ACM
14 years 8 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...