Gautam Das

According to our database1, Gautam Das
  • authored at least 196 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Efficient Computation of Subspace Skyline over Categorical Domains.
CoRR, 2017

Malware in the Future? Forecasting Analyst Detection of Cyber Events.
CoRR, 2017

Assisting Service Providers In Peer-to-peer Marketplaces: Maximizing Gain Over Flexible Attributes.
CoRR, 2017

Conceptual data sampling for breast cancer histology image classification.
Comp. in Bio. and Med., 2017

Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

HDBExpDetector: Aggregate Sudden-Change Detector over Dynamic Web Databases.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Density Based Clustering over Location Based Services.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

A Probabilistic Framework for Estimating Pairwise Distances Through Crowdsourcing.
Proceedings of the 20th International Conference on Extending Database Technology, 2017

Efficient Computation of Subspace Skyline over Categorical Domains.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2016
A holistic and principled approach for the empty-answer problem.
VLDB J., 2016

Faster Random Walks by Rewiring Online Social Networks On-the-Fly.
ACM Trans. Database Syst., 2016

AD-WIRE: Add-on for Web Item Reviewing System.
PVLDB, 2016

Collaborative Crowdsourcing with Crowd4U.
PVLDB, 2016

Query Reranking As A Service.
PVLDB, 2016

Discovering the Skyline of Web Databases.
PVLDB, 2016

A Gas Cell Based on Hollow-Core Photonic Crystal Fiber (PCF) and Its Application for the Detection of Greenhouse Gas (GHG): Nitrous Oxide (N2O).
J. Sensors, 2016

HDBSCAN: Density based Clustering over Location Based Services.
CoRR, 2016

Web Item Reviewing Made Easy By Leveraging Available User Feedback.
CoRR, 2016

Query Reranking As A Service.
CoRR, 2016

ANALOC: Efficient analytics over Location Based Services.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015
Task assignment optimization in knowledge-intensive crowdsourcing.
VLDB J., 2015

Leveraging History for Faster Sampling of Online Social Networks.
PVLDB, 2015

Worker Skill Estimation in Team-Based Tasks.
PVLDB, 2015

Privacy Implications of Database Ranking.
PVLDB, 2015

Walk, Not Wait: Faster Sampling Over Online Social Networks.
PVLDB, 2015

Aggregate Estimations over Location Based Services.
PVLDB, 2015

Structured Analytics in Social Media.
PVLDB, 2015

Hidden Database Research and Analytics (HYDRA) System .
IEEE Data Eng. Bull., 2015

DRESS: dimensionality reduction for efficient sequence search.
Data Min. Knowl. Discov., 2015

Leveraging History for Faster Sampling of Online Social Networks.
CoRR, 2015

"The Whole Is Greater Than the Sum of Its Parts": Optimization in Collaborative Crowdsourcing.
CoRR, 2015

Aggregate Estimations over Location Based Services.
CoRR, 2015

Discovering the Skyline of Web Databases.
CoRR, 2015

The TagAdvisor: Luring the Lurkers to Review Web Items.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Principled Optimization Frameworks for Query Reformulation of Database Queries.
Proceedings of the Second International Workshop on Exploratory Search in Databases and the Web, 2015

Querying Hidden Attributes in an Online Community Network.
Proceedings of the 12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2015

Answering Complex Queries in an Online Community Network.
Proceedings of the Ninth International Conference on Web and Social Media, 2015

Task Assignment Optimization in Collaborative Crowdsourcing.
Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

2014
An expressive framework and efficient algorithms for the analysis of collaborative tagging.
VLDB J., 2014

On Skyline Groups.
IEEE Trans. Knowl. Data Eng., 2014

Beyond Itemsets: Mining Frequent Featuresets over Structured Items.
PVLDB, 2014

Aggregate Estimation Over Dynamic Hidden Web Databases.
PVLDB, 2014

HDBTracker: Monitoring the Aggregates On Dynamic Hidden Web Databases.
PVLDB, 2014

Optimization in Knowledge-Intensive Crowdsourcing.
CoRR, 2014

Rank-Based Inference over Web Databases.
CoRR, 2014

Walk, Not Wait: Faster Sampling Over Online Social Networks.
CoRR, 2014

Aggregate Estimation Over Dynamic Hidden Web Databases.
CoRR, 2014

Exploration and mining of web repositories.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

Aggregate estimation over a microblog platform.
Proceedings of the International Conference on Management of Data, 2014

IQR: an interactive query relaxation system for the empty-answer problem.
Proceedings of the International Conference on Management of Data, 2014

Query Hidden Attributes in Social Networks.
Proceedings of the 2014 IEEE International Conference on Data Mining Workshops, 2014

Exploiting group recommendation functions for flexible preferences.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

Ranking item features by mining online user-item interactions.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

Price trade-offs in social media advertising.
Proceedings of the second ACM conference on Online social networks, 2014

Exploration and Mining of Web Repositories.
Proceedings of the 20th International Conference on Management of Data, 2014

Anything You Can Do, I Can Do Better: Finding Expert Teams by CrewScout.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013
The Move-Split-Merge Metric for Time Series.
IEEE Trans. Knowl. Data Eng., 2013

Sampling Online Social Networks.
IEEE Trans. Knowl. Data Eng., 2013

Rank Discovery From Web Databases.
PVLDB, 2013

A Probabilistic Optimization Framework for the Empty-Answer Problem.
PVLDB, 2013

Top-K Product Design Based on Collaborative Tagging Data
CoRR, 2013

Faster random walks by rewiring online social networks on-the-fly.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

Breaking the top-k barrier of hidden web databases?
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

Crowds, not Drones: Modeling Human Factors in Interactive Crowdsourcing.
Proceedings of the First VLDB Workshop on Databases and Crowdsourcing, 2013

Mining a search engine's corpus without a query pool.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Generating informative snippet to maximize item visibility.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Just-in-Time Analytics on Large File Systems.
IEEE Trans. Computers, 2012

The data analytics group at the qatar computing research institute.
SIGMOD Record, 2012

MapRat: Meaningful Explanation, Interactive Exploration and Geo-Visualization of Collaborative Ratings.
PVLDB, 2012

Who Tags What? An Analysis Framework.
PVLDB, 2012

Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field.
J. Discrete Algorithms, 2012

No Silver Bullet: Identifying Security Vulnerabilities in Anonymization Protocols for Hospital Databases.
IJHISI, 2012

Faster Random Walks By Rewiring Online Social Networks On-The-Fly
CoRR, 2012

Digging Deeper into Deep Web Databases by Breaking Through the Top-k Barrier
CoRR, 2012

Who Tags What? An Analysis Framework
CoRR, 2012

Aggregate suppression for enterprise search engines.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

On skyline groups.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Randomized Generalization for Aggregate Suppression Over Hidden Web Databases.
PVLDB, 2011

MRI: Meaningful Interpretations of Collaborative Ratings.
PVLDB, 2011

Exploration of Deep Web Repositories.
PVLDB, 2011

Crucial contribution of the multiple copies of the initiator tRNA genes in the fidelity of tRNAfMet selection on the ribosomal P-site in Escherichia coli.
Nucleic Acids Research, 2011

ASAP: Eliminating algorithm-based disclosure in privacy-preserving data publishing.
Inf. Syst., 2011

Mining a search engine's corpus: efficient yet unbiased sampling and aggregate estimation.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Attribute domain discovery for hidden web databases.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

MOBIES: mobile-interface enhancement service for hidden web database.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Leveraging collaborative tagging for web item design.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Interactive itinerary planning.
Proceedings of the 27th International Conference on Data Engineering, 2011

Just-in-Time Analytics on Large File Systems.
Proceedings of the 9th USENIX Conference on File and Storage Technologies, 2011

2010
Mining Time Series Data.
Proceedings of the Data Mining and Knowledge Discovery Handbook, 2nd ed., 2010

Space efficiency in group recommendation.
VLDB J., 2010

An Access Cost-Aware Approach for Object Retrieval over Multiple Sources.
PVLDB, 2010

Facetedpedia: dynamic generation of query-dependent faceted interfaces for wikipedia.
Proceedings of the 19th International Conference on World Wide Web, 2010

Call to order: a hierarchical browsing approach to eliciting users' preference.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Constructing and exploring composite items.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Unbiased estimation of size and other aggregates over hidden web databases.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Versatile publishing for privacy preservation.
Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

Algorithm-safe privacy-preserving data publishing.
Proceedings of the EDBT 2010, 2010

Turbo-charging hidden database samplers with overflowing queries and skew reduction.
Proceedings of the EDBT 2010, 2010

Facetedpedia: enabling query-dependent faceted search for wikipedia.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Sampling Methods in Approximate Query Answering Systems.
Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

Anytime measures for top-k algorithms on exact and fuzzy data sets.
VLDB J., 2009

Determining Attributes to Maximize Visibility of Objects.
IEEE Trans. Knowl. Data Eng., 2009

Improved Search for Socially Annotated Data.
PVLDB, 2009

Measure-driven Keyword-Query Expansion.
PVLDB, 2009

Keyword querying and Ranking in Databases.
PVLDB, 2009

Group Recommendation: Semantics and Efficiency.
PVLDB, 2009

HDSampler: revealing data behind web form interfaces.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Privacy preservation of aggregates in hidden databases: why and how?
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Privacy risks in health databases from aggregate disclosure.
Proceedings of the 2nd International Conference on Pervasive Technologies Related to Assistive Environments, 2009

DynaCet: Building Dynamic Faceted Search Systems over Databases.
Proceedings of the 25th International Conference on Data Engineering, 2009

Leveraging COUNT Information in Sampling Hidden Databases.
Proceedings of the 25th International Conference on Data Engineering, 2009

Ranking objects based on relationships and fixed associations.
Proceedings of the EDBT 2009, 2009

Top-k Algorithms and Applications.
Proceedings of the Database Systems for Advanced Applications, 2009

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining.
Proceedings of the Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11., 2009

TRANS: Top-k Implementation Techniques of Minimum Effort Driven Faceted Search For Databases.
Proceedings of the 15th International Conference on Management of Data, 2009

2008
Analyzing the Structure and Evolution of Massive Telecom Graphs.
IEEE Trans. Knowl. Data Eng., 2008

The Discrete Basis Problem.
IEEE Trans. Knowl. Data Eng., 2008

Categorical skylines for streaming data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Distinct value estimation on peer-to-peer networks.
Proceedings of the 1st ACM International Conference on Pervasive Technologies Related to Assistive Environments, 2008

Standing Out in a Crowd: Selecting Attributes for Maximum Visibility.
Proceedings of the 24th International Conference on Data Engineering, 2008

Region Sampling: Continuous Adaptive Sampling on Sensor Networks.
Proceedings of the 24th International Conference on Data Engineering, 2008

Minimum-effort driven dynamic faceted search in structured databases.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

Efficient sampling of information in social networks.
Proceedings of the Proceeding of the 2008 ACM Workshop on Search in Social Media, 2008

2007
Optimized stratified sampling for approximate query processing.
ACM Trans. Database Syst., 2007

Efficient Approximate Query Processing in Peer-to-Peer Networks.
IEEE Trans. Knowl. Data Eng., 2007

Introduction to special issue ACM SIGKDD 2006.
TKDD, 2007

Report on the First International Workshop on Ranking in Databases (DBRank'07).
SIGMOD Record, 2007

Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Ad-hoc Top-k Query Answering for Data Streams.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Anytime Measures for Top-k Algorithms.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

A random walk approach to sampling hidden databases.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2007

An Integrated Development Environment for Web Service Composition.
Proceedings of the 2007 IEEE International Conference on Web Services (ICWS 2007), 2007

STAR: A System for Tuple and Attribute Ranking of Query Answers.
Proceedings of the 23rd International Conference on Data Engineering, 2007

2006
Probabilistic information retrieval approach for ranking of database query results.
ACM Trans. Database Syst., 2006

Answering Top-k Queries Using Views.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

Ordering the attributes of query results.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

The Discrete Basis Problem.
Proceedings of the Knowledge Discovery in Databases: PKDD 2006, 2006

Approximating Aggregation Queries in Peer-to-Peer Networks.
Proceedings of the 22nd International Conference on Data Engineering, 2006

XML Query Routing in Structured P2P Systems.
Proceedings of the Databases, 2006

On the structural properties of massive telecom call graphs: findings and implications.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

Vulnerabilities of Internet Access Mechanisms from Mobile Ad Hoc Networks.
Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005
Hop counting based lightweight quality of service model for sensor devices.
IJAHUC, 2005

Approximate Query Processing.
Proceedings of the 20° Simpósio Brasileiro de Bancos de Dados, 2005

Mining Chains of Relations.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Distributed core assisted scalable data dissemination in mobile ad hoc networks.
Proceedings of the 1st International Conference on Collaborative Computing: Networking, 2005

CCID: Core construction for information dissemination in ad hoc scenario.
Proceedings of the Third IASTED International Conference on Communications and Computer Networks, 2005

Mining Time Series Data.
Proceedings of the Data Mining and Knowledge Discovery Handbook., 2005

2004
Summary-based routing for content-based event distribution networks.
Computer Communication Review, 2004

Probabilistic Ranking of Database Query Results.
Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, August 31, 2004

Effective Use of Block-Level Sampling in Statistics Estimation.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Rotation invariant distance measures for trajectories.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

2003
Dynamic Sample Selection for Approximate Query Processing.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

Automated Ranking of Database Query Results.
Proceedings of the CIDR 2003, 2003

2002
Optimally computing a shortest weakly visible line segment inside a simple polygon.
Comput. Geom., 2002

DBXplorer: enabling keyword search over relational databases.
Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002

DBXplorer: A System for Keyword-Based Search over Relational Databases.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

2001
Time-Series Similarity Problems and Well-Separated Geometric Sets.
Nord. J. Comput., 2001

Lower bounds for computing geometric spanners and approximate shortest paths.
Discrete Applied Mathematics, 2001

Time Series Similarity Measures and Time Series Indexing.
Proceedings of the 2001 ACM SIGMOD international conference on Management of data, 2001

A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries.
Proceedings of the 2001 ACM SIGMOD international conference on Management of data, 2001

Overcoming Limitations of Sampling for Aggregation Queries.
Proceedings of the 17th International Conference on Data Engineering, 2001

2000
A lower bound for approximating the geometric minimum weight matching.
Inf. Process. Lett., 2000

Context-Based Similarity Measures for Categorical Databases.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2000

1998
Similarity of Attributes by External Probes.
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998

Rule Discovery from Time Series.
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998

1997
A Fast Algorithm for Constructing Sparse Euclidean Spanners.
Int. J. Comput. Geometry Appl., 1997

LR-visibility in Polygons.
Comput. Geom., 1997

On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees.
Comput. Geom., 1997

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.
Algorithmica, 1997

Finding Similar Time Series.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 1997

Episode Matching.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

Time-Series Similarity Problems and Well-Separated Geometric Sets.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

The visibility graph contains a bounded-degree spanner.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
Constructing Degree-3 Spanners with Other Sparseness Properties.
Int. J. Found. Comput. Sci., 1996

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.
Proceedings of the Algorithms, 1996

Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
New sparseness results on graph spanners.
Int. J. Comput. Geometry Appl., 1995

On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Euclidean spanners: short, thin, and lanky.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

A New Way to Weigh Malnourished Euclidean Graphs.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Short cuts in higher dimensional space.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Finding all Weakly-Visible Chords of a Polygon in Linear Time.
Nord. J. Comput., 1994

Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

A Fast Algorithm for Constructing Sparse Euclidean Spanners.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
On Sparse Spanners of Weighted Graphs.
Discrete & Computational Geometry, 1993

Constructing Degree-3 Spanners with Other Sparseness Properties.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Optimally Sparse Spanners in 3-Dimensional Euclidean Space.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

LR-visibility in Polygons.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Minimum Vertex Hulls for Polyhedral Domains.
Theor. Comput. Sci., 1992

New Sparseness Results on Graph Spanners.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Geometric Searching and Link Distance (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1991

1990
Generating Sparse Spanners for Weighted Graphs.
Proceedings of the SWAT 90, 1990

Minimum Vertex Hulls for Polyhedral Domains.
Proceedings of the STACS 90, 1990

1989
Which Triangulations Approximate the Complete Graph?.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989


  Loading...