#### Filter Results:

- Full text PDF available (185)

#### Publication Year

1974

2017

- This year (14)
- Last 5 years (109)
- Last 10 years (183)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Sanjay Agrawal, Surajit Chaudhuri, Gautam Das
- ICDE
- 2002

Internet search engines have popularized the keywordbased search paradigm. While traditional database management systems offer powerful query languages, they do not allow keyword-based search. In this paper, we discuss DBXplorer, a system that enables keywordbased search in relational databases. DBXplorer has been implemented using a commercial relational… (More)

We consider the problem of finding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple example is a rule such as "a period of low telephone call activity is usually followed by a sharp rise ill call vohune". Examples of rules relating two or more time series are "if the… (More)

- Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares
- Discrete & Computational Geometry
- 1993

The Göttingen State and University Library provides access to digitized documents strictly for noncommercial educational, research and private purposes and makes no warranty with regard to their use for other purposes. Some of our collections are protected by copyright. Publication and/or broadcast in any form (including electronic) requires prior written… (More)

- Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila
- IEEE Transactions on Knowledge and Data…
- 2006

Matrix decomposition methods represent a data matrix as a product of two factor matrices: one containing basis vectors that represent meaningful concepts in the data, and another describing how the observed data can be expressed as combinations of the basis vectors. Decomposition methods have been studied extensively, but many methods return real-valued… (More)

Euclidean spanners are important data structures in geometric algorithm design, because they provide a means of approximating the complete Euclidean graph with only O(n) edges, so that the shortest path length between each pair of points is not more than a constant factor longer than the Euclidean distance between the points. In many applications of… (More)

Ranking and returning the most relevant results of a query is a popular paradigm in Information Retrieval. We discuss challenges and investigate several approaches to enable ranking in databases, including adaptations of known techniques from information retrieval. We present results of preliminary experiments.

- Sihem Amer-Yahia, Senjuti Basu Roy, Ashish Chawla, Gautam Das, Cong Yu
- PVLDB
- 2009

We study the problem of group recommendation. Recommendation is an important information exploration paradigm that retrieves interesting items for users based on their profiles and past activities. Single user recommendation has received significant attention in the past due to its extensive use in Amazon and Netflix. How to recommend to a group of users… (More)

The problem of obtaining efficient answers to top-<i>k</i> queries has attracted a lot of research attention. Several algorithms and numerous variants of the top-<i>k</i> retrieval problem have been introduced in recent years. The general form of this problem requests the <i>k</i> highest ranked values from a relation, using monotone combining functions on… (More)

- Sanjay Agrawal, Surajit Chaudhuri, Gautam Das
- SIGMOD Conference
- 2002

1. Motivation Internet search engines have popularized keyword based search. While relational database systems offer powerfifl structured query languages such as SQL, there is no support for keyword search over databases. The simplicity of keyword search as a querying paradigm offers compelling values for data exploration. Specifically, keyword search does… (More)

- Gautam Das, Giri Narasimhan
- Int. J. Comput. Geometry Appl.
- 1994

Let <italic>G=(V,E)</italic> be a <italic>n</italic>-vertex connected graph with positive edge weights. A subgraph <italic>G</italic>′ is a <italic>t</italic>-spanner if for all <italic>u,v</italic><inline-equation> <f> ∈</f> </inline-equation><italic>V</italic>, the distance between <italic>u</italic> and <italic>v</italic> in the subgraph is… (More)