Learn More
The network topology of vehicular ad-hoc network (VANET) in a city environment consists of many possible paths and junctions that forms the routing paths. Shortest path routing is not viable because each path has to be populated with vehicles. A scalable multi-hop routing protocol that adapts well to the city environment even with rapidly changing network(More)
We describe a complete hardware/software system, dubbed Universal Real-Time Navigational Assistance (URNA), which enables communication of relevant location-aware information to a blind person carrying a Bluetooth-enabled cell phone. Although URNA can be used for a number of different applications (e.g., an information kiosk at a shopping mall or public(More)
We describe a complete hardware/software system, dubbed Universal Real-Time Navigational Assistance (URNA), which enables communication of relevant location-aware information to a blind person carrying a Bluetooth-enabled cell phone. Although URNA can be used for a number of different applications (e.g., an information kiosk at a shopping mall or public(More)
This paper introduces a modification to an index calculus representation for the Double-Base Number System (DBNS). The DBNS uses the bases 2 and 3; it is redundant (very sparse) and has a simple two-dimensional representation. An extremely sparse form of the DBNS uses a single non-zero digit to represent any real number with arbitrary precision. In this(More)
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P , such that p u,i = 1 if and only if the i th arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance(More)