Bridging the gap between systems biology and medicine (2009)
Clermont, Gilles, Auffray, Charles, Moreau, Yves, Rocke, David M, Dalevi, Daniel, Dubhashi, Devdatt, ...
Abstract Systems biology has matured considerably as a discipline over the last decade, yet some of the key challenges separating current research efforts in systems biology and clinically useful...
Daniel Dalevi, Devdatt Dubhashi
Abstract. Recently Peres and Shields discovered a new method for estimating the order of a stationary fixed order Markov chain [15]. They showed that the estimator is consistent by proving a...
Adaptive Dynamics of Realistic Small-World Networks (2008)
Mogren, Olof, Sandberg, Oskar, Verendel, Vilhelm, Dubhashi, Devdatt
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search in small-world networks, we conduct an experimental analysis of a dynamic algorithm that produces...
Localized techniques for broadcasting in wireless sensor networks.” Algorithmica (2008)
Devdatt Dubhashi, Olle Häggström, Lorenzo Orecchia, Chiara Petrioli, Andrea Vitaletti
Abstract. In this paper we tackle the problem of designing simple, localized, low energy consuming, reliable protocols for one-to-all communication in large scale wireless sensor networks. Our first...
BIOINFORMATICS ORIGINAL PAPER (2008)
Genome Analysis, Daniel Dalevi, Devdatt Dubhashi, Malte Hermansson
Vol. 22 no. 5 2006, pages 517–522 doi:10.1093/bioinformatics/btk029 Bayesian classifiers for detecting HGT using fixed and variable order markov models of genomic signatures
Devdatt Dubhashi, Luigi Laura, Ro Panconesi
Abstract. We introduce a random planted model of bi-categorical data to model the problem of collaborative filtering or categorical clustering. We adapt the ideas of an algorithm due to Condon and...
Devdatt Dubhashi, Gabriele Mambrini, Ro Panconesi, Chiara Petrioli
1 Introduction The Bluetooth (BT) technology, as described in the Specifications of the Bluetooth System Version 1.1 is one of the most promising enabling technologies for pervasive and ubiquitous...
Chapter 1 CONCENTRATION OF MEASURE FOR RANDOMIZED ALGORITHMS: TECHNIQUES AND ANALYSIS (2007)
Randomized algorithms often turn out to be simpler and faster than their deterministic counterparts. For certain problems, like primality testing, there is no matching polynomial-time deterministic...
Devdatt Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we rst show how to compute connected and weakly connected...
Devdatt Dubhashi, Devdatt Dubhashi, David A. Grable, David A. Grable, Alessandro Panconesi, Alessandro Panconesi, ...
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 publications in the BRICS Report Series. Copies...
Dalevi, Daniel, Dubhashi, Devdatt, Hermansson, Malte
Recently Peres and Shields discovered a new method for estimating the order of a stationary fixed order Markov chain. They showed that the estimator is consistent by proving a threshold result. While...
Dalevi, Daniel, Dubhashi, Devdatt, Hermansson, Malte
Recently Peres and Shields discovered a new method for estimating the order of a stationary fixed order Markov chain. They showed that the estimator is consistent by proving a threshold result. While...
Dalevi, Daniel, Dubhashi, Devdatt, Hermansson, Malte
Recently Peres and Shields discovered a new method for estimating the order of a stationary fixed order Markov chain. They showed that the estimator is consistent by proving a threshold result. While...
Dalevi, Daniel, Dubhashi, Devdatt, Hermansson, Malte
Recently Peres and Shields discovered a new method for estimating the order of a stationary fixed order Markov chain. They showed that the estimator is consistent by proving a threshold result. While...
Devdatt Dubhashi, Gothenburg Sweden, Kleinberg Model, Kleinberg Model
Kleinberg Model
D.P.: Randomization in Constraint Programming for Airline Planning (2006)
Lars Otten, Mattias Grönkvist, Devdatt Dubhashi
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to real-world...
Dalevi, Daniel, Dubhashi, Devdatt, Hermansson, Malte
Motivation: Analyses of genomic signatures are gaining attention as they allow studies of species-specific relationships without involving alignments of homologous sequences. A naïve Bayesian...
Devdatt Dubhashi, Johan Jonasson, Desh Ranjan
Abstract We study negative dependence properties of a sampling process due to Srinivasan to produce distributions on level sets with given marginals. We give a simple proof that the distribution...
Balls and Bins: a Study in Negative Dependence (1998)
Devdatt Dubhashi, Devdatt Dubhashi, Desh Ranjan, Desh Ranjan
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 publications in the BRICS Report Series. Copies...
Near optimal distributed edge colouring via the nibble method (1998)
Devdatt Dubhashi, David A. Grable, Alessandro Panconesi
We give a distributed randomized algorithm to edge colour a network. Let G be a graph with n nodes and maximum degree #. Here we prove:
Near-Optimal, Distributed Edge Colouring Via the Nibble Method (1998)
Devdatt Dubhashi, David A. Grable, Informatik Hu Berlin, Alessandro Panconesi
We give a distributed randomized algorithm for graph edge colouring. Let G be a graph with n nodes and maximum degree \Delta. Here we prove: ffl If ffl ? 0 is fixed and \Delta AE log n, the algorithm...
Near-Optimal, Distributed Edge Colouring via the Nibble Method (1997)
Devdatt Dubhashi, David A. Grable, Informatik Hu Berlin, Alessandro Panconesi
We give a distributed randomized algorithm for graph edge colouring. Let G be a graph with n nodes and maximum degree \Delta. Here we prove: ffl If ffl ? 0 is fixed and \Delta AE log n, the algorithm...
Negative dependence through the FKG inequality (1996)
Devdatt Dubhashi, Devdatt Dubhashi, Volker Priebe, Volker Priebe, Im Stadtwald, Desh Ranjan, ...
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 publications in the BRICS Report Series. Copies...
Negative dependence through the FKG inequality (1996)
Devdatt Dubhashi, Volker Priebe, Desh Ranjan
We investigate random variables arising in occupancy problems, and show the variables to be negatively associated, that is, negatively dependent in a strong sense. Our proofs are based on the FKG...
Simple Proofs of Occupancy Tail Bounds (1995)
Devdatt P. Dubhashi, Devdatt Dubhashi
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 publications in the BRICS Report Series. Copies...
Simple Proofs of Occupancy Tail Bounds (1995)
Devdatt P. Dubhashi, Devdatt Dubhashi
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...
A Lower Bound for Area--Universal Graphs (1994)
Gianfranco Bilardi Shiva, Devdatt Dubhashi, K. Mehlhorn
We establish a lower bound on the efficiency of area--universal circuits. The area A u of every graph H that can host any graph G of area (at most) A with dilation d, and congestion c p A= log log A...
A lower bound for area-universal graphs (1994)
Bilardi, Gianfranco, Chaudhuri, Shiva, Dubhashi, Devdatt, Mehlhorn, Kurt
We establish a lower bound on the efficiency of rea--universal circuits. The area A u of every graph H that can host any graph G of area (at most) A with dilation d, and congestion c p A= log log A...
Daniel Dalevi, Devdatt Dubhashi, Malte Hermansson
Recently Peres and Shields discovered a new method for estimating the order of a stationary fixed order Markov chain. They showed that the estimator is consistent by proving a threshold result. While...
(Probabilistic) Recurrence Relations Revisited
Shiva Chaudhuri, Devdatt Dubhashi
. The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T (x) = a(x)+T (H(x)), where a is a function and H(x) is a random...
Bridging the gap between systems biology and medicine
Clermont, Gilles, Auffray, Charles, Moreau, Yves, Rocke, David M, Dalevi, Daniel, Dubhashi, Devdatt, ...
Systems biology has matured considerably as a discipline over the last decade, yet some of the key challenges separating current research efforts in systems biology and clinically useful results are...