Rahul Mehta

Learn More
OBJECTIVE To compare subjective and objective findings between patients with true dehiscence versus thin bone over the superior semicircular canal (SSC). STUDY DESIGN Retrospective case series. SETTING Tertiary referral center. PATIENTS All patients from our institution with true dehiscence or thin bone over the SSC on computed tomography temporal(More)
  • Rahul Mehta
  • 2014
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the problem where the player has oracle access to the computer player's moves. Specifically, we show that for an n × n game board G, computing a sequence of moves to reach a particular configuration C from an initial configuration C(More)
The application of the Multi-stage Interconnection Networks (MINs) in Systems–on–Chip (SoC) and Application Specific Networks–on–Chip (NoC) is hottest since year 2002. Nevertheless, nobody used them practically for parallel communication. However, to overcome all the previous problems, a new method is proposed that uses MINs(More)
OBJECTIVE Can magnetic resonance imaging (MRI) diagnose abnormally thin and dehiscent superior semicircular canals (SSCs) that traditionally rely on evaluation by computed tomography (CT) imaging? STUDY DESIGN Retrospective clinical study. SETTING Tertiary referral center. PATIENTS Adults who underwent both MRI and CT of the temporal bones over the(More)
The National Electricity Market of Singapore (NEMS) is designed to promote the efficient supply of competitively priced electricity. In Singapore, the Power Demand and Uniform Singapore Energy Price (USEP) vary in half hour periods. This paper presents a Multi-agent System (MAS) to effectively manage the energy sources of a microgrid depending on the power(More)
In this paper, we present a new push-relabel algorithm for the maximum flow problem on flow networks with n vertices and m arcs. Our algorithm computes a maximum flow in O(mn) time on sparse networks where m = O(n). To our knowledge, this is the first O(mn) time push-relabel algorithm for the m = O(n) edge case; previously, it was known that push-relabel(More)