Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent denis-helic.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent markus-strohmaier.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent christoph-trattner.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent markus-muhr.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent kristina-lerman.
- item-5 previous item-4.
- prophiler-a-fast-filter-for-the-large-scale-detect creator christopher-kruegel.
- prophiler-a-fast-filter-for-the-large-scale-detect creator davide-canali.
- prophiler-a-fast-filter-for-the-large-scale-detect creator giovanni-vigna.
- prophiler-a-fast-filter-for-the-large-scale-detect creator marco-cova.
- prophiler-a-fast-filter-for-the-large-scale-detect type InProceedings.
- prophiler-a-fast-filter-for-the-large-scale-detect label "Prophiler: A Fast Filter for the Large-Scale Detection of Malicious Web Pages".
- prophiler-a-fast-filter-for-the-large-scale-detect sameAs prophiler-a-fast-filter-for-the-large-scale-detect.
- prophiler-a-fast-filter-for-the-large-scale-detect abstract "Malicious web pages that host drive-by-download exploits have become a popular means for compromising hosts on the Internet and, subsequently, for creating large-scale botnets. In a drive-by-download exploit, an attacker embeds a malicious script (typically written in JavaScript) into a web page. When a victim visits this page, the script is executed and attempts to compromise the browser or one of its plugins. To detect drive-by-download exploits, researchers have developed a number of systems that analyze web pages for the presence of malicious code. Most of these systems use dynamic analysis. That is, they run the scripts associated with a web page either directly in a real browser (running in a virtualized environment) or in an emulated browser, and they monitor the scripts' executions for malicious activity. While the tools are quite precise, the analysis process is costly, often requiring in the order of tens of seconds for a single page. Therefore, performing this analysis on a large set of web pages containing hundreds of millions of samples can be prohibitive. One approach to reduce the resources required for performing large-scale analysis of malicious web pages is to develop a fast and reliable filter that can quickly discard pages that are benign, forwarding to the costly analysis tools only the pages that are likely to contain malicious code. In this paper, we describe the design and implementation of such a filter. Our filter, called Prophiler, uses static analysis techniques to quickly examine a web page for malicious content. This analysis takes into account features derived from the HTML contents of a page, from the associated JavaScript code, and from the corresponding URL. We automatically derive detection models that use these features using machine-learning techniques applied to labeled datasets. To demonstrate the effectiveness and efficiency of Prophiler, we crawled and collected millions of pages, which we analyzed for malicious behavior. Our results show that our filter is able to reduce the load on a more costly dynamic analysis tools by more than 85%, with a negligible amount of missed malicious pages.".
- prophiler-a-fast-filter-for-the-large-scale-detect hasAuthorList authorList.
- prophiler-a-fast-filter-for-the-large-scale-detect hasTopic web-security.
- prophiler-a-fast-filter-for-the-large-scale-detect hasTopic World_Wide_Web.
- prophiler-a-fast-filter-for-the-large-scale-detect isPartOf proceedings.
- prophiler-a-fast-filter-for-the-large-scale-detect title "Prophiler: A Fast Filter for the Large-Scale Detection of Malicious Web Pages".
- 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 davide-canali.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent marco-cova.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent giovanni-vigna.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent christopher-kruegel.
- item-4 previous item-3.
- query-segmentation-revisited creator benno-stein.
- query-segmentation-revisited creator christof-braeutigam.
- query-segmentation-revisited creator martin-potthast.
- query-segmentation-revisited creator matthias-hagen.
- query-segmentation-revisited type InProceedings.
- query-segmentation-revisited label "Query Segmentation Revisited".
- query-segmentation-revisited sameAs query-segmentation-revisited.
- query-segmentation-revisited abstract "We address the problem of query segmentation: given a keyword query, the task is to group the keywords into phrases, if possible. Previous approaches to the problem achieve reasonable segmentation performance but are tested only against a small corpus of manually segmented queries. In addition, many of the previous approaches are fairly intricate as they use expensive features and are difficult to be reimplemented. The main contribution of this paper is a new method for query segmentation that is easy to implement, fast, and that comes with a segmentation accuracy comparable to current state-of-the-art techniques. Our method uses only raw web n-gram frequencies and Wikipedia titles that are stored in a hash table. At the same time, we introduce a new evaluation corpus for query segmentation. With about 50000 human-annotated queries, it is two orders of magnitude larger than the corpus being used up to now.".
- query-segmentation-revisited hasAuthorList authorList.
- query-segmentation-revisited hasTopic query-analysis.
- query-segmentation-revisited hasTopic World_Wide_Web.
- query-segmentation-revisited isPartOf proceedings.
- query-segmentation-revisited title "Query Segmentation Revisited".
- 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 matthias-hagen.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent martin-potthast.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent benno-stein.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent christof-braeutigam.
- item-4 previous item-3.
- rewriting-queries-on-sparql-views creator anastasios-kementsietsidis.
- rewriting-queries-on-sparql-views creator feifei-li.
- rewriting-queries-on-sparql-views creator min-wang.
- rewriting-queries-on-sparql-views creator songyun-duan.
- rewriting-queries-on-sparql-views creator wangchao-le.
- rewriting-queries-on-sparql-views type InProceedings.
- rewriting-queries-on-sparql-views label "Rewriting Queries on SPARQL Views".
- rewriting-queries-on-sparql-views sameAs rewriting-queries-on-sparql-views.
- rewriting-queries-on-sparql-views abstract "The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, or when integrating RDF data from disparate sources. We approach this problem by rewriting SPARQL queries over the views to equivalent queries over the underlying RDF data, thus avoiding the costs entailed by view materialization and maintenance. We show that SPARQL query rewriting combines the most challenging aspects of rewriting for the relational and XML cases: like the relational case, SPARQL query rewriting requires synthesizing multiple views; like the XML case, the size of the rewritten query is exponential to the size of the query and the views. In this paper, we present the first native query rewriting algorithm for SPARQL. For an input SPARQL query over a set of virtual SPARQL views, the rewritten query resembles a union of conjunctive queries and can be of exponential size. We propose optimizations over the basic rewriting algorithm to (i) minimize each conjunctive query in the union; (ii) eliminate conjunctive queries with empty results from evaluation; and (iii) efficiently prune out big portions of the search space of empty rewritings. The experiments, performed on two RDF stores, show that our algorithms are scalable and independent of the underlying RDF stores. Furthermore, our optimizations have order of magnitude improvements over the basic rewriting algorithm in both the rewriting size and evaluation time.".
- rewriting-queries-on-sparql-views hasAuthorList authorList.
- rewriting-queries-on-sparql-views hasTopic query-and-ontology-languages.
- rewriting-queries-on-sparql-views hasTopic World_Wide_Web.
- rewriting-queries-on-sparql-views isPartOf proceedings.