1199 search results - page 101 / 240 » Robust inference of trees |
183
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
137
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: Structure-dependent substitution matrices increase the accuracy of sequence alignments when the 3D structure of one sequence is known, and are successful e.g. in fold ...
173
click to vote
PAMI
2011
14 years 11 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
128
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant infor...
255
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper, we present a stream-based mining algorithm for online anomaly prediction. Many real-world applications such as data stream analysis requires continuous cluster opera...