Sciweavers

6365 search results - page 36 / 1273
» Fast Local Computation Algorithms
Sort
View
VIS
2007
IEEE
188views Visualization» more  VIS 2007»
16 years 1 months ago
Fast Filament Tracking Using Graphics Hardware
Recent developments in biomedical imaging are producing massive data sets containing structures, such as fine filaments, that are difficult to visualize. In this paper, we describ...
David M. Mayerich, Zeki Melek, John Keyser
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 16 days ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
15 years 1 months ago
A RELIEF Based Feature Extraction Algorithm
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
Yijun Sun, Dapeng Wu
95
Voted
EMNLP
2010
14 years 10 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
113
Voted
TON
2010
279views more  TON 2010»
14 years 10 months ago
Distributed algorithms for minimum cost multicast with network coding
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...
Yufang Xi, Edmund M. Yeh