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

Nagabhushana Prabhu

dblp:53/6950 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 2014
0000-0001-6297-882XORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-authorTheory of computation · 2Artificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1Databases, data management, data science and information retrieval · 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.

Network and information security
1 paper
Privacy and data protection · 100%
Computer networks
1 paper
Network optimization and economics · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
anonymization
0.212014
Accuracy-Constrained Privacy-Preserving Access Control Mechanismfor Relational Data · IEEE Trans. Knowl. Data Eng. 2014
Privacy and data protection › anonymization
k-anonymity and l-diversity
0.212014
Accuracy-Constrained Privacy-Preserving Access Control Mechanismfor Relational Data · IEEE Trans. Knowl. Data Eng. 2014
Privacy and data protection
privacy-preserving access control
0.212014
Accuracy-Constrained Privacy-Preserving Access Control Mechanismfor Relational Data · IEEE Trans. Knowl. Data Eng. 2014
Network optimization and economics
dynamic resource allocation
0.011995
Dynamic Resource Allocation for Multimedia Services in Mobile Communication Environments · IEEE J. Sel. Areas Commun. 1995
Network optimization and economics
resource allocation
0.011995
Dynamic Resource Allocation for Multimedia Services in Mobile Communication Environments · IEEE J. Sel. Areas Commun. 1995

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

suppression · 0.2heuristics · 0.2generalization · 0.2simulation · 0.0
YearPublicationVenuePosition
2014 Accuracy-Constrained Privacy-Preserving Access Control Mechanismfor Relational Data
abstract
Access control mechanisms protect sensitive information from unauthorized users. However, when sensitive information is shared and a Privacy Protection Mechanism (PPM) is not in place, an authorized user can still compromise the privacy of a person leading to identity disclosure. A PPM can use suppression and generalization of relational data to anonymize and satisfy privacy requirements, e.g., k-anonymity and l-diversity, against identity and attribute disclosure. However, privacy is achieved at the cost of precision of authorized information. In this paper, we propose an accuracy-constrained privacy-preserving access control framework. The access control policies define selection predicates available to roles while the privacy requirement is to satisfy the k-anonymity or l-diversity. An additional constraint that needs to be satisfied by the PPM is the imprecision bound for each selection predicate. The techniques for workload-aware anonymization for selection predicates have been discussed in the literature. However, to the best of our knowledge, the problem of satisfying the accuracy constraints for multiple roles has not been studied before. In our formulation of the aforementioned problem, we propose heuristics for anonymization algorithms and show empirically that the proposed approach satisfies imprecision bounds for more permissions and has lower total imprecision than the current state of the art.
Zahid Pervaiz, Walid G. Aref, Arif Ghafoor, Nagabhushana Prabhu
IEEE Trans. Knowl. Data Eng.4
2005 Optimization on Lie manifolds and pattern recognition
Nagabhushana Prabhu, Hung-Chieh Chang, Maria deGuzman
Pattern Recognit.1
1998 Counting d -Step Paths in Extremal Dantzig Figures
Jeffrey C. Lagarias, Nagabhushana Prabhu
Discret. Comput. Geom.2
1997 The d-Step Conjecture and Gaussian Elimination
Jeffrey C. Lagarias, Nagabhushana Prabhu, James A. Reeds
Discret. Comput. Geom.2
1996 The Parameter Space of the d-step Conjecture
Jeffrey C. Lagarias, Nagabhushana Prabhu, James A. Reeds
FSTTCS2
1996 Complexity of the Gravitational Method for Linear Programming
Thomas L. Morin, Nagabhushana Prabhu
FSTTCS2
1995 Facet-Reducing Cuts of a Convex Polytope
Nagabhushana Prabhu
Discret. Comput. Geom.1
1995 Hamiltonian Simple Polytopes
Nagabhushana Prabhu
Discret. Comput. Geom.1
1995 Dynamic Resource Allocation for Multimedia Services in Mobile Communication Environments
abstract
As demand for networked multimedia applications is increasing rapidly, it is important to provide these services in mobile communication environments. In this paper, we identify system requirements for base stations in order to support multimedia services. These requirements include supporting concurrent connections for multiple users, allocation of resources dynamically to satisfy diverse resource requirements for multimedia applications, and reallocation of resources during handoff incurred by user movement or newly generated calls. These requirements can be used to design an interface between land-based and mobile environments to handle one of the most challenging issues in multimedia communication: enforcing interstream and intrastream synchronizations. We propose two quality of presentation (QOP) parameters for evaluating the quality of mobile multimedia connections, and analyze the validity of these requirements.>
Miae Woo, Nagabhushana Prabhu, Arif Ghafoor
IEEE J. Sel. Areas Commun.2