Geometrical problems and computations General Terms (2009)
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
Point location is an extremely well-studied problem both in internal memory models and recently also in the external memory model. In this paper, we present an I/O-efficient dynamic data structure...
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries (2009)
Grossi, Roberto, Orlandi, Alessio, Raman, Rajeev, Rao, S. Srinivasa
We consider the problem of representing, in a compressed format, a bit-vector $S$ of $m$ bits with $n$ 1s, supporting the following operations, where $b \in \{0, 1 \}$: $rank_b(S,i)$ returns the...
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries (2009)
Grossi, Roberto, Orlandi, Alessio, Raman, Rajeev, Rao, S. Srinivasa
We consider the problem of representing, in a compressed format, a bit-vector~$S$ of $m$ bits with $n$ $mathbf{1}$s, supporting the following operations, where $b in { mathbf{0}, mathbf{1} }$:...
© 2007, INSInet Publication Neural Network Approach for Modelling Global Solar Radiation (2008)
T. Krishnaiah, S. Srinivasa Rao, K. Madhumurthy, K. S. Reddy
Abstract: India lies in sunny belt between 6 ° N and 32 ° N latitudes, its geographical position favors the development and utilization of solar energy. This paper presents an artificial neural...
Fuzzy based approach for privacy preserving publication of data (2008)
V. Valli Kumari, S. Srinivasa Rao, Kvsvn Raju, Kv Ramana, Bvs Avadhani
Data privacy is the most acclaimed problem when publishing individual data. It ensures individual data publishing without disclosing sensitive data. The much popular approach, is K-Anonymity, where...
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes (2008)
Pagh, Rasmus, Rao, S. Srinivasa
Let S be a finite, ordered alphabet, and let x = x_1 x_2 ... x_n be a string over S. A "secondary index" for x answers alphabet range queries of the form: Given a range [a_l,a_r] over S, return the...
Compressing Binary Decision Diagrams (2008)
Hansen, Esben Rune, Rao, S. Srinivasa, Tiedemann, Peter
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in...
DOI: 10.1007/s00453-004-1146-6 Representing Trees of Higher Degree 1 (2008)
David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Abstract. This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, we turn our...
Abstract An Optimal Bloom Filter Replacement ∗ (2008)
Anna Pagh, Rasmus Pagh, S. Srinivasa Rao
This paper considers space-efficient data structures for storing an approximation S ′ to a set S such that S ⊆ S ′ and any element not in S belongs to S ′ with probability at most ɛ. The...
B. Ravikumar, S. Srinivasa Rao
It is shown that the MAX2SAT problem is NP-complete even if every variable appears in at most three clauses. However, if every variable appears in at most two clauses, it is shown that it (and even...
Abstract. We first give a representation of a suffix tree that uses n lg n+ O(n) bits of space and supports searching for a pattern in the given text (from a fixed size alphabet) in O(m) time, where...
J. Ian Munro, S. Srinivasa Rao
We give the first representation of a suffix tree that uses n lg n+O(n) bits of space and supports searching for a pattern string in the given text (from a fixed size alphabet) in O(m) time, where n...
Jaikumar Radhakrishnan, S. Srinivasa Rao
Abstract. We look at time-space tradeoffs for the static membership problem in the bit-probe model. The problem is to represent a set of size up to n from a universe of size m using a small number of...
Succinct Dynamic Data Structures Rajeev Raman 1, Venkatesh Raman 2 (2007)
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array consisting of a...
Succinct indexes for strings, binary relations and multi-labeled trees (2007)
Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
We define and design succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures called succinct indexes that occupy asymptotically less space than the...
Succinct encoding for XPath location steps (2006)
Jérémy Barbay, S. Srinivasa Rao
Abstract. We consider in this paper the problem of encoding XML documents in small space while still supporting XPath Location steps efficiently. We model XML documents as multi-labeled trees, and...
Full-Text Indexes in External Memory (2003)
Kärkkäinen, Juha, Rao, S. Srinivasa, Meyer, Ulrich, Sanders, Peter, Sibeyn, Jop
Computing Refined Buneman Trees in Cubic Time (2002)
Gerth Stlting Brodal, Rolf Fagerberg, S. Srinivasa Rao
Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance based...
Computing Refined Buneman Trees in Cubic Time (2002)
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, S. Srinivasa Rao
Abstract Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance...
This document in subdirectoryRS/02/51/ Computing Refined Buneman Trees in Cubic Time (2002)
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, S. Srinivasa Rao, Copyright C, ...
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...
Static dictionaries supporting rank (1999)
Venkatesh Raman, S. Srinivasa Rao
Abstract. A static dictionary is a data structure for storing a subset S of a finite universe U so that membership queries can be answered efficiently. We explore space efficient structures to also...
An Analysis of Environmental Sustainability Index for G-8 and SAARC Countries
In the year 1990, the OECD countries initiated a specific program on environmental indicator to track environmental progress and integrate environmental concerns into decision-making. Subsequently,...