Sciweavers

1673 search results - page 87 / 335
» Taming the Dynamics of Distributed Data
Sort
View
145
Voted
AAAI
2000
15 years 6 months ago
Multivariate Clustering by Dynamics
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
SPAA
2005
ACM
15 years 10 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
130
Voted
BMCBI
2008
112views more  BMCBI 2008»
15 years 5 months ago
A general modeling and visualization tool for comparing different members of a group: application to studying tau-mediated regul
Background: Innumerable biological investigations require comparing collections of molecules, cells or organisms to one another with respect to one or more of their properties. Al...
Arnab Bhattacharya, Sasha Levy, Adria LeBoeuf, Mic...
168
Voted
DC
2010
15 years 1 months ago
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
In this paper, we present RAMBO, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. RAMBO provides a highly reliable, hi...
Seth Gilbert, Nancy A. Lynch, Alexander A. Shvarts...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 5 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine