Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Medha Atre"'
Autor:
Medha Atre
Publikováno v:
Proceedings of the ACM Web Conference 2022.
Web-based phishing attacks nowadays exploit popular cloud web hosting services and apps such as Google Sites and Typeform for hosting their attacks. Since these attacks originate from reputable domains and IP addresses of the cloud services, traditio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2efee9393fadccb695944295d73a714
http://arxiv.org/abs/2204.02446
http://arxiv.org/abs/2204.02446
Publikováno v:
IPDPS Workshops
Use of Deep Learning (DL) in commercial applications such as image classification, sentiment analysis and speech recognition is increasing. When training DL models with large number of parameters and/or large datasets, cost and speed of training can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cea1230b7701eff74ff24b276a8da97
Publikováno v:
Blockchain
Integrity and security of databases are maintained with access control policies and firewalls. However, insider attacks - where someone with administrative privileges tampers with the data - pose a unique challenge. In this paper, we propose Verity -
Publikováno v:
COMAD/CODS
Resource Description Framework (RDF) graphs are widely used for representing semantically linked data in various domains. Many modern RDF specific storage, indexing, and query optimization systems internally represent the node and edge labels of the
Publikováno v:
CIKM
There is a growing trend towards enriching the RDF content from its classical Subject-Predicate-Object triple form to an annotated representation which can model richer relationships such as including fact provenance, fact confidence, higher-order re
Autor:
Medha Atre
Publikováno v:
WWW (Companion Volume)
Evaluating SPARQL queries with the DISTINCT clause may become memory intensive due to the requirement of additional auxiliary data structures, like hash-maps, to discard the duplicates. DISTINCT queries make up to 16% of all the queries (e.g., DBPedi
Autor:
Medha Atre
SPARQL basic graph pattern (BGP) (a.k.a. SQL inner-join) query optimization is a well researched area. However, optimization of OPTIONAL pattern queries (a.k.a. SQL left-outer-joins) poses additional challenges, due to the restrictions on the \textit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06d5e0839f918cb9b0d7b9282016a608
http://arxiv.org/abs/1304.7799
http://arxiv.org/abs/1304.7799
Publikováno v:
WWW
The Semantic Web community, until now, has used traditional database systems for the storage and querying of RDF data. The SPARQL query language also closely follows SQL syntax. As a natural consequence, most of the SPARQL query processing techniques
Publikováno v:
SSRN Electronic Journal.
With a huge amount of RDF data available on the web, the ability to find and access relevant information is crucial. Traditional approaches to storing, querying, and reasoning fall short when faced with web-scale data. We present a system that combin