683 search results - page 5 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
STOC
2010
ACM
14 years 16 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
BIOCOMP
2006
13 years 9 months ago
2006
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams...