Matches in ScholarlyData for { ?s ?p ?o. }
- 801 sameAs 801.
- 801 abstract "Combining data and code from third-party sources has enabled a new wave of web mashups that add creativity and functionality to web applications. However, browsers are poorly designed to pass data between domains, often forcing web developers to abandon security in the name of functionality. To address this deficiency, we developed Subspace, a novel cross-domain communication mechanism that allows efficient communication across domains without sacrificing security. Our prototype requires only a small JavaScript library, and works across all major browsers. We believe Subspace can serve as a new secure communication primitive for web mashups.".
- 801 hasAuthorList authorList.
- 801 isPartOf proceedings.
- 801 title "Subspace: Secure Cross-Domain Communication for Web Mashups".
- 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 collin-jackson.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent helen-wang.
- item-2 previous item-1.
- 89 creator christian-borgs.
- 89 creator jennifer-chayes.
- 89 creator kamal-jain.
- 89 creator mohammad-mahdian.
- 89 creator nicole-immorlica.
- 89 creator omid-etesami.
- 89 type InProceedings.
- 89 label "Dynamics of bid optimization in online advertisement auctions".
- 89 sameAs 89.
- 89 abstract "We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and study a natural bidding heuristic in which advertisers attempt to optimize their utility by equalizing their return-on-investment across all keywords. We show that existing auction mechanisms combined with this heuristic can experience cycling (as has been observed in many current systems), and therefore propose a modified class of mechanisms with small random perturbations. This perturbation is reminiscent of the small time-dependent perturbations employed in the dynamical systems literature to convert many types of chaos into attracting motions. We show that the perturbed mechanism provably converges in the case of first-price auctions and experimentally converges in the case of second-price auctions. Moreover, the point of convergence has a natural economic interpretation as the unique market equilibrium in the case of first-price mechanisms. In the case of second-price auctions, we conjecture that it converges to the ``supply-aware'' market equilibrium. Thus, our results can be alternatively described as a tatonnement process for convergence to market equilibrium in which prices are adjusted on the side of the buyers rather than the sellers. We also observe that perturbation in mechanism design is useful in a broader context: In general, it can allow bidders to ``share'' a particular item, leading to stable allocations and pricing for the bidders, and improved revenue for the auctioneer.".
- 89 hasAuthorList authorList.
- 89 isPartOf proceedings.
- 89 title "Dynamics of bid optimization in online advertisement auctions".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasLastItem item-6.
- item-1 type ListItem.
- item-1 hasContent christian-borgs.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jennifer-chayes.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent omid-etesami.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent nicole-immorlica.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent kamal-jain.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent mohammad-mahdian.
- item-6 previous item-5.
- 91 creator hung-chim.
- 91 creator xiaotie-deng.
- 91 type InProceedings.
- 91 label "A New Suffix Tree Similarity Measure for Document Clustering".
- 91 sameAs 91.
- 91 abstract "In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree similarity measure in Group-average Agglomerative Hierarchical Clustering (GAHC) algorithm, we developed a new suffix tree document clustering algorithm (NSTC). Our experimental results on two standard document clustering benchmark corpus OHSUMED and RCV1 indicate that the new clustering algorithm is a very effective document clustering algorithm. Comparing with the results of traditional keyword tfidf similarity measure in the same GHAC algorithm, NSTC achieved an improvement of 51% on the average of F-measure score. Furthermore, we apply the new clustering algorithm in analyzing the Web documents in online forum communities. A topic oriented clustering algorithm is developed to help people in assessing, classifying and searching the the Web documents in a large forum community.".
- 91 hasAuthorList authorList.
- 91 isPartOf proceedings.
- 91 title "A New Suffix Tree Similarity Measure for Document Clustering".
- 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 hung-chim.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent xiaotie-deng.
- item-2 previous item-1.
- 103 creator chuan-xiao.
- 103 creator jeffrey-xu-yu.
- 103 creator wei-wang.
- 103 creator xuemin-lin.
- 103 type InProceedings.
- 103 label "Efficient Similarity Joins for Near Duplicate Detection".
- 103 sameAs 103.
- 103 abstract "With the increasing amount of data and the need to integrate data from multiple data sources, one of the challenging issues is to find near duplicate records efficiently. In this paper, we focus on efficient algorithms to find pair of records such that their similarities are above a given threshold. Several existing algorithms rely on the prefix filtering principle to avoid computing similarity values for all possible pairs of records. We propose new filtering techniques by exploiting the ordering information; they are integrated into the existing methods and drastically reduce the candidate sizes and hence improve the efficiency. Experimental results show our proposed algorithms can achieve up to 5x speed-up over previous algorithms on several real datasets and provide alternative solutions to the near duplicate Web page detection problem.".
- 103 hasAuthorList authorList.
- 103 hasTopic World_Wide_Web.
- 103 isPartOf proceedings.
- 103 keyword "Near Duplicate Detection".
- 103 keyword "Set Similarity Join".
- 103 title "Efficient Similarity Joins for Near Duplicate Detection".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.