Sciweavers

2888 search results - page 90 / 578
» Measuring the Learning Progress in a
Sort
View
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 5 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
TIT
2008
105views more  TIT 2008»
15 years 3 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
CCR
2006
76views more  CCR 2006»
15 years 4 months ago
Secure distributed data-mining and its application to large-scale network measurements
The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data -- for instance, how much traffi...
Matthew Roughan, Yin Zhang

Publication
173views
14 years 3 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...
CVPR
2007
IEEE
16 years 6 months ago
Utilizing Variational Optimization to Learn Markov Random Fields
Markov Random Field, or MRF, models are a powerful tool for modeling images. While much progress has been made in algorithms for inference in MRFs, learning the parameters of an M...
Marshall F. Tappen