2512 search results - page 252 / 503 » Learning from Highly Structured Data by Decomposition |
135
click to vote
MICRO
1999
IEEE
15 years 8 months ago
1999
IEEE
Branch predictors typically use combinations of branch PC bits and branch histories to make predictions. Recent improvements in branch predictors have come from reducing the effec...
107
click to vote
IPMI
2005
Springer
16 years 5 months ago
2005
Springer
Having accurate left ventricle (LV) segmentations across a cardiac cycle provides useful quantitative (e.g. ejection fraction) and qualitative information for diagnosis of certain ...
162
click to vote
ICDM
2009
IEEE
15 years 11 months ago
2009
IEEE
—The success of transfer to improve learning on a target task is highly dependent on the selected source data. Instance-based transfer methods reuse data from the source tasks to...
140
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that "similar" points in input space are mapped to ne...
139
click to vote
SENSYS
2006
ACM
15 years 10 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...