Devdatt P. Dubhashi
According to our database1, Devdatt P. Dubhashi authored at least 52 papers between 1992 and 2019.
Legend:Book In proceedings Article PhD thesis Other
A Non-Convex Optimization Approach to Correlation Clustering.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
LEGaTO: first steps towards energy-efficient toolset for heterogeneous computing.
Proceedings of the 18th International Conference on Embedded Computer Systems: Architectures, 2018
DeepColor: Reinforcement Learning optimizes information efficiency and well-formedness in color name partitioning.
Proceedings of the 40th Annual Meeting of the Cognitive Science Society, 2018
LEGaTO: towards energy-efficient, secure, fault-tolerant toolset for heterogeneous computing.
Proceedings of the 15th ACM International Conference on Computing Frontiers, 2018
AI dangers: imagined and real.
Commun. ACM, 2017
Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery.
Proceedings of the 34th International Conference on Machine Learning, 2017
Thompson Sampling for Stochastic Bandits with Graph Feedback.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
Distributed Vertex Coloring.
Encyclopedia of Algorithms, 2016
Visions and open challenges for a knowledge-based culturomics.
Int. J. on Digital Libraries, 2015
Extractive Summarization by Aggregating Multiple Similarities.
Proceedings of the Recent Advances in Natural Language Processing, 2015
Weighted Theta Functions and Embeddings with Applications to Max-Cut, Clustering and Summarization.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Neural context embeddings for automatic discovery of word senses.
Proceedings of the 1st Workshop on Vector Space Modeling for Natural Language Processing, 2015
Classifying Large Graphs with Differential Privacy.
Proceedings of the Modeling Decisions for Artificial Intelligence, 2015
Learning with Similarity Functions on Graphs using Matchings of Geometric Embeddings.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
Global graph kernels using geometric embeddings.
Proceedings of the 31th International Conference on Machine Learning, 2014
Federated clouds for biomedical research: Integrating OpenStack for ICTBioMed.
Proceedings of the 3rd IEEE International Conference on Cloud Networking, 2014
Lovász ϑ function, SVMs and finding dense subgraphs.
J. Mach. Learn. Res., 2013
Lovasz ϑ, SVMs and applications.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013
DLOREAN: Dynamic Location-Aware Reconstruction of Multiway Networks.
Proceedings of the 13th IEEE International Conference on Data Mining Workshops, 2013
Entity disambiguation in anonymized graphs using graph kernels.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013
Mining semantics for culturomics: towards a knowledge-based approach.
Proceedings of the 2013 international workshop on Mining unstructured big data using natural language processing, 2013
"The Lovasz $\theta$ function, SVMs and finding large dense subgraphs".
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012
NETGEM: Network Embedded Temporal GEnerative Model for gene expression data.
BMC Bioinformatics, 2011
Scalable multi-dimensional user intent identification using tree structured distributions.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011
Concentration of Measure for the Analysis of Randomized Algorithms.
Cambridge University Press, ISBN: 978-0-521-88427-3, 2009
Distributed Vertex Coloring.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Distributed Approximation Algorithms via LP-Duality and Randomization.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks.
Wireless Networks, 2007
Probabilistic analysis for a multiple depot vehicle routing problem.
Random Struct. Algorithms, 2007
Positive Influence and Negative Dependence.
Combinatorics, Probability & Computing, 2007
Localized Techniques for Broadcasting in Wireless Sensor Networks.
Bayesian classifiers for detecting HGT using fixed and variable order markov models of genomic signatures.
Randomization in Constraint Programming for Airline Planning.
Proceedings of the Principles and Practice of Constraint Programming, 2006
The Peres-Shields Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005
Irrigating ad hoc networks in constant time.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003
Near-Optimal, Distributed Edge Colouring via the Nibble Method.
Theor. Comput. Sci., 1998
Balls and bins: A study in negative dependence.
Random Struct. Algorithms, 1998
Talagrand's Inequality and Locality in Distributed Computing.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998
Martingales and Locality in Distributed Computing.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998
Probabilistic Recurrence Relations Revisited.
Theor. Comput. Sci., 1997
Simple proofs of occupancy tail bounds.
Random Struct. Algorithms, 1997
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.
Inf. Process. Lett., 1997
The Fourth Moment in Luby's Distribution.
Theor. Comput. Sci., 1995
(Probabilistic) Recurrence Realtions Revisited.
Proceedings of the LATIN '95: Theoretical Informatics, 1995
Near-Optimal Distributed Edge Coloring.
Proceedings of the Algorithms, 1995
A Lower Bound for Area-Universal Graphs.
Inf. Process. Lett., 1994
Quantifier Elimination in p-adic Fields.
Comput. J., 1993
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993
On Decidable Varieties of Heyting Algebras.
J. Symb. Log., 1992