#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1976

2015

- This year (0)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Prabhaker Mateti, Narsingh Deo
- SIAM J. Comput.
- 1976

A brief description and comparison of all known algorithms for enumerating all circuits of a graph is provided, and upper bounds on computation time of many algorithms are derived. The vector space method of circuit enumeration is discussed. It is proved that K3, K4, K4 x and K3, are the only undirected and reduced graphs which do not have any edge-disjoint… (More)

- Prabhaker Mateti, Narsingh Deo
- Computing
- 1982

We present several parallel algorithms for the problem of finding shortest paths from a specified vertex (called the source) to all others in a weighted directed graph. The algorithms are for machines ranging from array processors, multipleinstruction multiple-data stream machines to a special network of processors. These algorithms have been designed by… (More)

- Chen Ding, Prabhaker Mateti
- IEEE Trans. Software Eng.
- 1990

OWL 2 EL is one of the tractable profiles of the Web Ontology Language (OWL) which is a W3C-recommended standard. OWL 2 EL provides sufficient expressivity to model large biomedical ontologies as well as streaming data such as traffic, while at the same time allows for efficient reasoning services. Existing reasoners for OWL 2 EL, however, use only a single… (More)

- Prabhaker Mateti
- SIGCSE
- 2003

We developed a laboratory-based course on Internet Security. The course is aimed at the senior undergraduate. This paper discusses the course and explains how others can set up their own labs to teach this course. All the laboratory work is conducted in a laboratory of PCs running Linux. We developed lecture notes for the course, and a web site to widely… (More)

- Prabhaker Mateti
- J. ACM
- 1981

Verification of certain properties of a class of programs is considered. The programs are written In a miniprogrammmg language that has variables of only two data types, a linear array of elements, and pomters to these elements. The array elements can only be exchanged; pointers can only be incremented or decremented by one Program properties to be venfied… (More)

- Raghava Mutharaju, Pascal Hitzler, Prabhaker Mateti
- SSWS@ISWC
- 2013

OWL 2 EL ontologies are used to model and reason over data from diverse domains such as biomedicine, geography and road traffic. Data in these domains is increasing at a rate quicker than the increase in main memory and computation power of a single machine. Recent efforts in OWL reasoning algorithms lead to the decrease in classification time from several… (More)

- Prabhaker Mateti
- Softw., Pract. Exper.
- 1983

A two level specification of the functional behaviour of a class of indenting programs for Pascal is presented. The transformation that these programs perform on the input text is a composition of splitting input lines, altering the blank space between lexical tokens and computing the margin required in front of each of the split lines. The high level… (More)

- Prabhaker Mateti, Joxan Jaffar
- Softw., Pract. Exper.
- 1983

- Raghava Mutharaju, Pascal Hitzler, Prabhaker Mateti
- SSWS@ISWC
- 2014

Automated generation of axioms from streaming data, such as traffic and text, can result in very large ontologies that single machine reasoners cannot handle. Reasoning with large ontologies requires distributed solutions. Scalable reasoning techniques for RDFS, OWL Horst and OWL 2 RL now exist. For OWL 2 EL, several distributed reasoning approaches have… (More)