1913 search results - page 278 / 383 » Using Data Mining in MURA Graphic Problems |
97
Voted
SISAP
2008
IEEE
15 years 10 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
174
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
135
click to vote
AUSDM
2008
Springer
15 years 5 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
122
click to vote
RECOMB
2010
Springer
15 years 10 months ago
2010
Springer
Constructing quantitative dynamic models of signaling pathways is an important task for computational systems biology. Pathway model construction is often an inherently incremental...
135
Voted
BMCBI
2010
15 years 28 days ago
2010
Background: Proton Magnetic Resonance (MR) Spectroscopy (MRS) is a widely available technique for those clinical centres equipped with MR scanners. Unlike the rest of MR-based tec...