S. N. Maheshwari

Publication Activity (10 Years)

Years Active: 1978-2020
Publications (10 Years): 2

Top Topics

Maximum A Posterior

Labeling Problems

Belief Propagation

Top Venues

IEEE Trans. Pattern Anal. Mach. Intell.

Publications

Ishant Shanu, Siddhant Bharti, Chetan Arora, S. N. Maheshwari
An Inference Algorithm for Multi-label MRF-MAP Problems with Clique Size 100. ECCV (20) (2020)
Ishant Shanu, Chetan Arora, S. N. Maheshwari
Inference in Higher Order MRF-MAP Problems With Small and Large Cliques. CVPR (2018)
Chetan Arora, Subhashis Banerjee, Prem Kumar Kalra, S. N. Maheshwari
Generalized Flows for Optimal Inference in Higher Order MRF-MAP. IEEE Trans. Pattern Anal. Mach. Intell. 37 (7) (2015)
Chetan Arora, S. N. Maheshwari
Multi-label Generic Cuts: Optimal Inference in Multi-label Multi-clique MRF-MAP Problems. CVPR (2014)
Chetan Arora, Subhashis Banerjee, Prem Kumar Kalra, S. N. Maheshwari
Fast Approximate Inference in Higher Order MRF-MAP Labeling Problems. CVPR (2014)
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari
Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAP. ECCV (5) (2012)
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari
An Efficient Graph Cut Algorithm for Computer Vision Problems. ECCV (3) (2010)
Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari
A near optimal algorithm for finding Euclidean shortest path in polygonal domain CoRR (2010)
Rahul Agarwal, Mahender Bisht, S. N. Maheshwari, Sanjiva Prasad
Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting. ICDCIT (2005)
Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
A Concurrency Control Algorithm for an Open and Safe Nested. J. Inf. Sci. Eng. 19 (2) (2003)
Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata. Data Knowl. Eng. 37 (2) (2001)
Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
Virtual partition algorithm in a nested transaction environment and its correctness. Inf. Sci. 137 (1-4) (2001)
Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava
Formalization and Proof of Correctness of the Crash Recovery Algorithm for an Open and Safe Nested Transaction Model. Int. J. Cooperative Inf. Syst. 10 (1-2) (2001)
Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava
An open and safe nested transaction model: concurrency and recovery. J. Syst. Softw. 55 (2) (2000)
Sanjiv Kapoor, S. N. Maheshwari
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. SIAM J. Comput. 30 (3) (2000)
Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment. ADBIS (1999)
Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
Formalization of Linear Hash Structures Using Nested Transactions and I/O Automation Model. IADT (1998)
Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava
Crash Recovery in an Open and Safe Nested Transaction Model. DEXA (1997)
Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discret. Comput. Geom. 18 (4) (1997)
Pratul Dublish, S. N. Maheshwari
Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs. MFCS (1990)
Joseph Cheriyan, S. N. Maheshwari
Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput. 18 (6) (1989)
Pratul Dublish, S. N. Maheshwari
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. PODS (1989)
Joseph Cheriyan, S. N. Maheshwari
The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network. Inf. Process. Lett. 31 (3) (1989)
Sanjiv Kapoor, S. N. Maheshwari
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. SCG (1988)
Pratul Dublish, S. N. Maheshwari
On O(N²) Equivalence Algorithm for Fan-Out Free Queries. ICDT (1988)
Joseph Cheriyan, S. N. Maheshwari
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. J. Algorithms 9 (4) (1988)
Joseph Cheriyan, S. N. Maheshwari
Analysis of Preflow Push Algorithms for Maximum Network Flow. FSTTCS (1988)
Pratul Dublish, S. N. Maheshwari
An O(n²) Algorithm for Fan-Out Free Query Optimization. FSTTCS (1987)
Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees. IEEE Trans. Computers 32 (6) (1983)
Dhruva Nath, S. N. Maheshwari
Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems. Inf. Process. Lett. 14 (1) (1982)
Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt
Parallel algorithms for the convex hull problem in two dimensions. CONPAR (1981)
Vishv M. Malhotra, M. Pramodh Kumar, S. N. Maheshwari
An O(|V|³) Algorithm for Finding Maximum Flows in Networks. Inf. Process. Lett. 7 (6) (1978)