S. N. Maheshwari

Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition, 2018

2015

Generalized Flows for Optimal Inference in Higher Order MRF-MAP.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2015

2014

Multi-label Generic Cuts: Optimal Inference in Multi-label Multi-clique MRF-MAP Problems.

[BibT_eX]

[DOI]

Chetan Arora

Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014

Fast Approximate Inference in Higher Order MRF-MAP Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014

2012

Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAP.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision - ECCV 2012, 2012

2010

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

[BibT_eX]

[DOI]

Rajasekhar Inkulu

CoRR, 2010

An Efficient Graph Cut Algorithm for Computer Vision Problems.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision, 2010

2005

Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Internet Technology, 2005

2004

The Web as a Dynamic Graph.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

2003

A Concurrency Control Algorithm for an Open and Safe Nested.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2003

2001

Virtual partition algorithm in a nested transaction environment and its correctness.

[BibT_eX]

[DOI]

Inf. Sci., 2001

Formalization and Proof of Correctness of the Crash Recovery Algorithm for an Open and Safe Nested Transaction Model.

[BibT_eX]

[DOI]

Int. J. Cooperative Inf. Syst., 2001

Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2001

2000

Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

An open and safe nested transaction model: concurrency and recovery.

[BibT_eX]

[DOI]

J. Syst. Softw., 2000

1999

On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment.

[BibT_eX]

[DOI]

Proceedings of the Advances in Databases and Information Systems, 1999

1998

Formalization of Linear Hash Structures Using Nested Transactions and I/O Automation Model.

[BibT_eX]

Proceedings of the Third International Conference on Integrated Design and Process Technology, IDPT, 1998

1997

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Discret. Comput. Geom., 1997

Crash Recovery in an Open and Safe Nested Transaction Model.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 8th International Conference, 1997

1990

Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Analysis of Preflow Push Algorithms for Maximum Network Flow.

[BibT_eX]

[DOI]

Joseph Cheriyan

SIAM J. Comput., 1989

The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network.

[BibT_eX]

[DOI]

Joseph Cheriyan

Inf. Process. Lett., 1989

Expressibility of Bounded-Arity Fixed-Point Query Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989

1988

Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs.

[BibT_eX]

[DOI]

Joseph Cheriyan

J. Algorithms, 1988

On O(N²) Equivalence Algorithm for Fan-Out Free Queries.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

An O(n²) Algorithm for Fan-Out Free Query Optimization.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1983

Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees.

[BibT_eX]

[DOI]

Dhruva Nath

P. C. P. Bhatt

IEEE Trans. Computers, 1983

1982

Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems.

[BibT_eX]

[DOI]

Dhruva Nath

Inf. Process. Lett., 1982

1981

Parallel algorithms for the convex hull problem in two dimensions.

[BibT_eX]

[DOI]

Dhruva Nath

P. C. P. Bhatt

Proceedings of the CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, 1981

1978

An O(|V|³) Algorithm for Finding Maximum Flows in Networks.

[BibT_eX]

[DOI]

Vishv M. Malhotra

M. Pramodh Kumar