2434 search results - page 123 / 487 » Algorithmic Randomness of Closed Sets |
115
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
225
Voted
DAGM
2006
Springer
15 years 7 months ago
2006
Springer
We present a new approach to integrated motion estimation and segmentation by combining methods from discrete and continuous optimization. The velocity of each of a set of regions ...
138
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
163
Voted
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...
163
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...