S. N. Maheshwari

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