S. N. Maheshwari - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2020

An Inference Algorithm for Multi-label MRF-MAP Problems with Clique Size 100Ishant Shanu, Siddhant Bharti, Chetan Arora 0001, S. N. Maheshwari. eccv 2020: 257-274 [doi]

2018

Inference in Higher Order MRF-MAP Problems With Small and Large CliquesIshant Shanu, Chetan Arora 0001, S. N. Maheshwari. cvpr 2018: 7883-7891 [doi]

2015

Generalized Flows for Optimal Inference in Higher Order MRF-MAPChetan Arora 0001, Subhashis Banerjee, Prem Kumar Kalra, S. N. Maheshwari. pami, 37(7):1323-1335, 2015. [doi]

2014

Multi-label Generic Cuts: Optimal Inference in Multi-label Multi-clique MRF-MAP ProblemsChetan Arora, S. N. Maheshwari. cvpr 2014: 1346-1353 [doi]

Fast Approximate Inference in Higher Order MRF-MAP Labeling ProblemsChetan Arora, Subhashis Banerjee, Prem Kumar Kalra, S. N. Maheshwari. cvpr 2014: 1338-1345 [doi]

2012

Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAPChetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari. eccv 2012: 17-30 [doi]

2010

An Efficient Graph Cut Algorithm for Computer Vision ProblemsChetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari. eccv 2010: 552-565 [doi]

2005

Divide and Concur: Employing Chandra and Toueg s Consensus Algorithm in a Multi-level SettingRahul Agarwal, Mahender Bisht, S. N. Maheshwari, Sanjiva Prasad. icdcit 2005: 172-183 [doi]

2003

A Concurrency Control Algorithm for an Open and Safe NestedSanjay Kumar Madria, S. N. Maheshwari, B. Chandra. jise, 19(2):283-328, 2003. [doi]

2001

Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automataSanjay Kumar Madria, S. N. Maheshwari, B. Chandra. DKE, 37(2):139-176, 2001. [doi]

Virtual partition algorithm in a nested transaction environment and its correctnessSanjay Kumar Madria, S. N. Maheshwari, B. Chandra. isci, 137(1-4):211-244, 2001.

Formalization and Proof of Correctness of the Crash Recovery Algorithm for an Open and Safe Nested Transaction ModelSanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava. ijcis, 10(1-2):1-50, 2001. [doi]

2000

Efficiently Constructing the Visibility Graph of a Simple Polygon with ObstaclesSanjiv Kapoor, S. N. Maheshwari. SICOMP, 30(3):847-871, 2000. [doi]

An open and safe nested transaction model: concurrency and recoverySanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava. jss, 55(2):151-165, 2000. [doi]

1999

On the Correctnes of Virtual Partition Algorithm in a Nested Transaction EnvironmentSanjay Kumar Madria, S. N. Maheshwari, B. Chandra. adbis 1999: 98-112 [doi]

1998

Formalization of Linear Hash Structures Using Nested Transactions and I/O Automation ModelSanjay Kumar Madria, S. N. Maheshwari, B. Chandra. iadt 1998: 521-530

1997

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the PlaneSanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell. dcg, 18(4):377-383, 1997. [doi]

Crash Recovery in an Open and Safe Nested Transaction ModelSanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava. DEXA 1997: 440-451

1990

Query Languages which Express all PTIME Queries for Trees and Unicyclic GraphsPratul Dublish, S. N. Maheshwari. mfcs 1990: 246-253

1989

The Parallel Complexity of Finding a Blocking Flow in a 3-Layer NetworkJoseph Cheriyan, S. N. Maheshwari. ipl, 31(3):157-161, 1989.

Analysis of Preflow Push Algorithms for Maximum Network FlowJoseph Cheriyan, S. N. Maheshwari. SICOMP, 18(6):1057-1086, 1989.

The parallel complexity of finding a blocking flow in a 3-layer networkJoseph Cheriyan, S. N. Maheshwari. ipl, 32(3):157-161, 1989. [doi]

Expressibility of Bounded-Arity Fixed-Point Query HierarchiesPratul Dublish, S. N. Maheshwari. PODS 1989: 324-335 [doi]

1988

Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected GraphsJoseph Cheriyan, S. N. Maheshwari. jal, 9(4):507-537, 1988.

Analysis of Preflow Push Algorithms for Maximum Network FlowJoseph Cheriyan, S. N. Maheshwari. fsttcs 1988: 30-48

On O(N²) Equivalence Algorithm for Fan-Out Free QueriesPratul Dublish, S. N. Maheshwari. icdt 1988: 176-190 [doi]

Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal ObstaclesSanjiv Kapoor, S. N. Maheshwari. compgeom 1988: 172-182 [doi]

1987

An O(n²) Algorithm for Fan-Out Free Query OptimizationPratul Dublish, S. N. Maheshwari. fsttcs 1987: 242-264

1983

Efficient VLSI Networks for Parallel Processing Based on Orthogonal TreesDhruva Nath, S. N. Maheshwari, P. C. P. Bhatt. TC, 32(6):569-581, 1983.

1982

Parallel Algorithms for the Connected Components and Minimal Spanning Tree ProblemsDhruva Nath, S. N. Maheshwari. ipl, 14(1):7-11, 1982.

1981

Parallel algorithms for the convex hull problem in two dimensionsDhruva Nath, S. N. Maheshwari, P. C. P. Bhatt. conpar 1981: 358-372

1978

Corrections and Comments on On Models for Diagnosable Systems and Probabilistic Fault Diagnosis S. N. Maheshwari, S. Louis Hakimi. TC, 27(3):287, 1978.

An O(|V|³) Algorithm for Finding Maximum Flows in NetworksVishv M. Malhotra, M. Pramodh Kumar, S. N. Maheshwari. ipl, 7(6):277-278, 1978.

1974

B74-36 Communication, Transmission, and Transportation NetworksS. N. Maheshwari. TC, 23(8):878, 1974. [doi]

1972

Optimum Locations of Centers in NetworksS. Louis Hakimi, S. N. Maheshwari. ior, 20(5):967-973, 1972. [doi]

Sign in or sign up to see more results.

runs on WebDSL