S. N. Maheshwari

According to our database1, S. N. Maheshwari authored at least 34 papers between 1972 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Inference in Higher Order MRF-MAP Problems With Small and Large Cliques.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition, 2018

Generalized Flows for Optimal Inference in Higher Order MRF-MAP.
IEEE Trans. Pattern Anal. Mach. Intell., 2015

Multi-label Generic Cuts: Optimal Inference in Multi-label Multi-clique MRF-MAP Problems.
Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014

Fast Approximate Inference in Higher Order MRF-MAP Labeling Problems.
Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014

Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAP.
Proceedings of the Computer Vision - ECCV 2012, 2012

A near optimal algorithm for finding Euclidean shortest path in polygonal domain
CoRR, 2010

An Efficient Graph Cut Algorithm for Computer Vision Problems.
Proceedings of the Computer Vision, 2010

Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting.
Proceedings of the Distributed Computing and Internet Technology, 2005

The Web as a Dynamic Graph.
Proceedings of the Handbook of Data Structures and Applications., 2004

A Concurrency Control Algorithm for an Open and Safe Nested.
J. Inf. Sci. Eng., 2003

Virtual partition algorithm in a nested transaction environment and its correctness.
Inf. Sci., 2001

Formalization and Proof of Correctness of the Crash Recovery Algorithm for an Open and Safe Nested Transaction Model.
Int. J. Cooperative Inf. Syst., 2001

Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata.
Data Knowl. Eng., 2001

Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles.
SIAM J. Comput., 2000

An open and safe nested transaction model: concurrency and recovery.
J. Syst. Softw., 2000

On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment.
Proceedings of the Advances in Databases and Information Systems, 1999

Formalization of Linear Hash Structures Using Nested Transactions and I/O Automation Model.
Proceedings of the Third International Conference on Integrated Design and Process Technology, IDPT, 1998

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane.
Discrete & Computational Geometry, 1997

Crash Recovery in an Open and Safe Nested Transaction Model.
Proceedings of the Database and Expert Systems Applications, 8th International Conference, 1997

Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Analysis of Preflow Push Algorithms for Maximum Network Flow.
SIAM J. Comput., 1989

The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network.
Inf. Process. Lett., 1989

Expressibility of Bounded-Arity Fixed-Point Query Hierarchies.
Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989

Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs.
J. Algorithms, 1988

On O(N²) Equivalence Algorithm for Fan-Out Free Queries.
Proceedings of the ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31, 1988

Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

An O(n²) Algorithm for Fan-Out Free Query Optimization.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees.
IEEE Trans. Computers, 1983

Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems.
Inf. Process. Lett., 1982

Parallel algorithms for the convex hull problem in two dimensions.
Proceedings of the CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, 1981

Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis".
IEEE Trans. Computers, 1978

An O(|V|³) Algorithm for Finding Maximum Flows in Networks.
Inf. Process. Lett., 1978

B74-36 Communication, Transmission, and Transportation Networks.
IEEE Trans. Computers, 1974

Optimum Locations of Centers in Networks.
Operations Research, 1972