A Vote to Stay the Course (2009)
Journal of Democracy - Volume 20, Number 4, October 2009
A new randomized algorithm for Document (2008)
Abstract — In today’s world, copy detection is a major problem. Students plagiarize assignments from the web and from each other. In such a scenario, we need a technique that can detect even...
Nuclear Stability in South Asia (2008)
International Security - Volume 33, Number 2, Fall 2008
Reporting the Partition of Punjab, 1947: Press, Public and Other Opinions (review) (2008)
Journal of Cold War Studies - Volume 10, Number 3, Summer 2008
India's Improbable Success (2008)
Journal of Democracy - Volume 19, Number 2, April 2008
Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh Ch, An Saha
algorithm for estimating frequency moments of data streams
Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi
The date of receipt and acceptance will be inserted by the editor Abstract There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only...
Abstract Bifocal Sampling for Skew-Resistant Join Size Estimation (2008)
Sumit Ganguly, Phillip B. Gibbons
This paper introduces bifocal sampling, a new technique for estimating the size of an equi-join of two relations. Bifocal sampling classi es tuples in each relation into two groups, sparse and dense,...
Lower bound for estimating frequency for update data streams (2008)
We consider general update streams, where, the stream is a sequence of updates of the form $(index, i, v)$, where, $i in {1,2 ldots, n}$ and $v in {-1,+1}$, signifying deletion or insertion,...
of Ecient Data Transfer (2007)
Koushik Chakraborty, Manpreet Singh, To The, Dr. Deepak Gupta, Dr. Sumit Ganguly
in Application Layer", by Koushik Chakraborty(96116) Manpreet Singh (96139) , has been carried out under my supervision and that this work has not been submitted elsewhere for a degree.
Finding Approximate Solutions to the Query Optimization (2007)
To The, Sourav Chatterji, Sourav Chatterji, Y. Mahesh Datt, Y. Mahesh Datt, Dr. Sumit Ganguly, ...
under the guidance of
"Query Optimization With One Parameter", by Ms.Anjali V. (2007)
Anjali V. Betawadkar, To The, Dr. Sumit Ganguly
Certified that the work contained in the thesis entitled
Design and Implementation of Algorithms for Star Query Optimization. M.Tech Thesis,, Deptt (2007)
Pinaki Chakrabarti, To The, Dr. Sumit Ganguly
has been carried out under my supervision and that this work has not been submitted elsewhere for a degree.
Implementation of Algorithms for Tree Query Optimization", by Hegde Hrishikesh (2007)
Hegde Hrishikesh P, To The, Dr. Sumit Ganguly
by
Sergio Greco, Carlo Zaniolo, Sumit Ganguly
Abstract. We propose an algorithm for pushing min and max aggregates into recursive predicates, while preserving query equivalence under certain monotonicity constraints. The transformed query is...
Dip. Elettronica Informatica e Sistemistica (2007)
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
A novel approach is proposed for expressing and computing eciently a large class of problems, including nding the shortest path in a graph, that were previously considered impervious to an ecient...
Six Decades of Independence (2007)
Journal of Democracy - Volume 18, Number 2, April 2007
Structure and Contingency in the Transformation of India's Foreign Policy (2007)
Streaming video requires RealPlayer to view.
Kashmir: Roots of Conflict, Paths to Peace (review) (2007)
Journal of Cold War Studies - Volume 9, Number 1, Winter 2007
A nearly optimal and deterministic summary structure for update data streams (2007)
The paper has been withdrawn due to an error in Lemma 1.
An algebraic approach to complexity of data stream computations (2007)
We consider a basic problem in the general data streaming model, namely, to estimate a vector $f \in \Z^n$ that is arbitrarily updated (i.e., incremented or decremented) coordinate-wise. The estimate...
On estimating frequency moments of data streams (2007)
Abstract. Space-economical estimation of the pth frequency moments, defined as Fp = P n i=1 |fi|p, for p> 0, are of interest in estimating all-pairs distances in a large data matrix [14], machine...
Problem Definition Spectral Clustering of Data Streams (2007)
Manu Bansal (y, Nitin Agarwal (y, Supervisor Prof, Sumit Ganguly
We want to design a spectral clustering algorithm for data streams that uses the conductance quality measure. Guha et al [1] present a framework for clustering data streams in an online fashion....
On estimating frequency moments of data streams (2007)
Abstract. Space-economical estimation of the pth frequency moments, defined as Fp = �n i=1 |fi|p, for p> 0, are of interest in estimating all-pairs distances in a large data matrix [14], machine...
CR-precis: A deterministic summary structure for update data streams (2006)
Ganguly, Sumit, Majumder, Anirban
We present the \crprecis structure, that is a general-purpose, deterministic and sub-linear data structure for summarizing \emph{update} data streams. The \crprecis structure yields the \emph{first...
No Strings Attached?: India's Policies and Foreign Aid, 1947-1966 (review) (2006)
Journal of Cold War Studies - Volume 8, Number 1, Winter 2006
On estimating path aggregates over streaming graphs (2006)
Abstract. We consider the updatable streaming graph model, where edges of a graph arrive or depart in arbitrary sequence and are processed in an online fashion using sub-linear space and time. We...
Deterministic K-set structure (2006)
Sumit Ganguly, Anirban Majumder
Abstract. A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the stream,...
Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks (2006)
Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi, Krishan Sabnani
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming in-creasingly important to the success of today’s Internet as a viable commercial and...
Nepal: Between Dictatorship and Anarchy (2005)
Ganguly, Sumit., Shoup, Brian.
Journal of Democracy - Volume 16, Number 4, October 2005
Join-Distinct aggregate estimation over update streams (2005)
Sumit Ganguly, Iit Kanpur, Minos Garofalakis
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Providing (perhaps...
Join-Distinct aggregate estimation over update streams (2005)
Sumit Ganguly, Iit Kanpur, Minos Garofalakis
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Providing (perhaps...
Estimating frequency moments of data streams using random linear combinations (2004)
Abstract. The problem of estimating the k th frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal paper by...
Distributed Set-Expression Cardinality Estimation (2004)
Abhinandan Das, Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi
We consider the problem of estimating set-expression cardinality in a distributed streaming environment where rapid update streams originating at remote sites are continually transmitted to a central...
Processing data-stream join aggregates using skimmed sketches (2004)
Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi
sganguly,minos,rastogi¡ Abstract. There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal,...
Gaurav Veda, Advisor Prof, Carlos Guestrin, Advisor Prof, Sumit Ganguly
LP approach for solving POMDP's
The Crisis of Indian Secularism (2003)
Journal of Democracy - Volume 14, Number 4, October 2003
ROLEX: Relational On-Line Exchange with XML (2003)
Philip Bohannon, Chengkai Li, Sumit Ganguly, Henry F. Korth, Xin (Luna) Dong, ...
uses a navigational profile for the user or application when it optimizes view-query plans. While navigational profiles can, in principle, be quite complex, we currently adopt a very simple model. If...
India's Multiple Revolutions (2002)
Journal of Democracy - Volume 13, Number 1, January 2002
On the Complexity of Database Query Optimization (2001)
Sai Surya, Kiran Evani, To The, Dr. Sumit Ganguly
In this thesis, we consider the complexity of computing the optimal join order sequences for star queries and general queries. We consider the following join methods in our thesis - indexed nested...
Parametric query optimization: A geometric approach (1999)
Varakur Ganga, Vara Prasad, To The, Dr. Sumit Ganguly
by
Design and Analysis of Parametric Query Optimization Algorithms (1998)
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such as selec-tivity and resource availability. The execution of such plans could...
Bifocal Sampling for Skew-Resistant Join Size Estimation (1996)
Sumit Ganguly, Phillip B. Gibbons, Yossi Matias, Avi Silberschatz
This paper introduces bifocal sampling, a new technique for estimating the size of an equi-join of two relations. Bifocal sampling classifies tuples in each relation into two groups, sparse and...
Optimizing Queries for Coarse Grain Parallelism (1993)
We consider the problem of optimizing select-project-join relational queries for minimum response time on parallel machines. The design of the optimizer is based on three ideas: (1) the concept and...
Fast Search Methods for Biological Sequence Databases (1993)
Sumit Ganguly, Jerry Leichter, Michiel Noordewier
Biology researchers have a pressing need for data management technologies which will make the storage and retrieval of DNA and protein sequence data accurate and efficient. The volume of data...
Query Optimization in Mobile Environments (1993)
We consider the issue of optimizing queries for a distributed processing in mobile environment. An interesting characteristic of mobile machines is that they depend on battery as a source of energy...
Sergio Greco, Carlo Zaniolo, Sumit Ganguly
The greedy paradigm of algorithm design is a well known tool used for efficiently solving many classical computational problems within the framework of pro-cedural languages. However, it is very...
Energy Efficient Query Optimization (1992)
Recently, a number of small yet powerful mobile computers have appeared on the market. Endowed with large disk capacity and network hardware, such systems are capable of holding large amounts of...