Sciweavers

5 search results - page 1 / 1
» Fast perfect weighted resampling
Sort
View
ICASSP
2008
IEEE
14 years 6 days ago
Fast perfect weighted resampling
We describe an algorithm for perfect weighted-random sampling of a population with time complexity O(m + n) for sampling m inputs to produce n outputs. This algorithm is an increm...
Bart Massey
ICIP
2007
IEEE
14 years 2 days ago
H2O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering
In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named H2O, is easy to...
Laurent Condat, Brigitte Forster-Heinlein, Dimitri...
IPMI
2011
Springer
12 years 9 months ago
Fast Brain Matching with Spectral Correspondence
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
Herve Lombaert, Leo Grady, Jonathan R. Polimeni, F...
ISBRA
2010
Springer
14 years 7 days ago
"Master-Slave" Biological Network Alignment
d abstract), Nicola Ferraro, Luigi Palopoli, Simona Panni and Simona E. Rombo. Uncovering Hidden Phylogenetic Consensus d abstract), Nicholas Pattengale, Krister Swenson and Bernar...
Nicola Ferraro, Luigi Palopoli, Simona Panni, Simo...
SPAA
2010
ACM
13 years 10 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...