We design a faster algorithm for the all-pairs shortest path problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we improve the best known time complexity of O(n(log log n)/ logn) to O(n log log n/ log n). As an application, we show the k-maximum subarray problem can be solved in O(kn log log n/ log n) time for small k.

Abstract A substantial proportion of proven oil and gas reserves the world is contained in carbonate reservoir. It estimated that about 60% world’s 40% are confined reservoirs. Exploration development hydrocarbons reservoirs much more challenging due to poor seismic imaging reservoir heterogeneity caused by diagenetic changes. Evaluation has been a high priority for researchers geoscientists wo...

introduction mohammad-abad oryan is the only potential source of borate in the north-east of iran located in 50 km south of sabzevar. the area is located in tuff marl, tuffaceous marl, volcanic braccia and tuff braccia structures. remote sensing techniques, geological studies and integration of this data in gis were applied in an area of about 600 square kilometers to locate the promising areas...

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however programmers have designed these structures in a way to preserve their consistency upon recovery. Previous approaches, typically transactional, inherently used logging, resulting in implementations that are significantly slower than their DRAM counterparts. In this paper, we introduce ...

Identification and mapping of the significant alterations are the main objectives of the exploration geochemical surveys. The field study is time-consuming and costly to produce the classified maps. Therefore, the processing of remotely sensed data, which provide timely and multi-band (multi-layer) data, can be substituted for the field study. In this study, the ASTER imagery is used for altera...

With organisations, local bodies and governments now releasing large amounts of linked data, there is a great opportunity for users and software agents to look for structured information, serving their information needs. Query logs, preserving such information needs can be harvested to understand what linked data consumers are looking for. Though statistical analysis of such query logs have bee...

A team of identical, oblivious, mobile agents (robots) has to explore an anonymous unoriented tree by visiting all its nodes. Robots start from arbitrary different nodes of the tree and operate in Look-Compute-Move cycles. At the end, every node must be visited by at least one robot, and all robots must stop. In one cycle, a robot takes a snapshot of the current configuration (Look), makes a de...

We point out a simple poly-time log-space routing algorithm in ad hoc networks with guaranteed delivery using universal exploration sequences.