Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anupam Mediratta

dblp:78/6244 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 2Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 100%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Human-computer interaction and pervasive computing
1 paper
Usability and user experience research · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › model selection
parameter selection
0.112005
Domain-Dependent Parameter Selection of Search-based Algorithms Compatible with User Performance Criteria · AAAI 2005
Services computing and microservices › service composition
web service composition
0.112005
Building Applications Using End to End Composition of Web Services · AAAI 2005
Mathematical optimization
parameter tuning
0.112005
Domain-Dependent Parameter Selection of Search-based Algorithms Compatible with User Performance Criteria · AAAI 2005
Distributed systems
service-oriented architecture
0.012005
Building Applications Using End to End Composition of Web Services · AAAI 2005

Methods — techniques the papers use, named apart from their topics

search-based algorithm · 0.2parameter selection · 0.2
YearPublicationVenuePosition
2020 Privacy Preserving Detection of Path Bias Attacks in Tor
abstract
Abstract Anonymous communication networks like Tor are vulnerable to attackers that control entry and exit nodes. Such attackers can compromise the essential anonymity and privacy properties of the network. In this paper, we consider the path bias attack– where the attacker induces a client to use compromised nodes and thus links the client to their destination. We describe an efficient scheme that detects such attacks in Tor by collecting routing telemetry data from nodes in the network. The data collection is differentially private and thus does not reveal behaviour of individual users even to nodes within the network. We show provable bounds for the sample complexity of the scheme and describe methods to make it resilient to introduction of false data by the attacker to subvert the detection process. Simulations based on real configurations of the Tor network show that the method works accurately in practice.
Lauren Watson, Anupam Mediratta, Tariq Elahi, Rik Sarkar
Proc. Priv. Enhancing Technol.2
2005 Building Applications Using End to End Composition of Web Services
Vikas Agarwal, Girish Chafle, Koustuv Dasgupta, Neeran M. Karnik, Arun Kumar 0002, Ashish Kundu, Anupam Mediratta, Sumit Mittal, Biplav Srivastava
AAAI7
2005 Domain-Dependent Parameter Selection of Search-based Algorithms Compatible with User Performance Criteria
Biplav Srivastava, Anupam Mediratta
AAAI2