Sciweavers

7648 search results - page 201 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
ISBI
2004
IEEE
16 years 3 months ago
A Fast Fully 4D Incremental Gradient Reconstruction Algorithm for List Mode PET Data
We present a fully four-dimensional, globally convergent, incremental gradient algorithm to estimate the continuous-time tracer density from list mode positron emission tomography...
Quanzheng Li, Evren Asma, Richard M. Leahy
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 4 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
ICML
2007
IEEE
16 years 3 months ago
Robust non-linear dimensionality reduction using successive 1-dimensional Laplacian Eigenmaps
Non-linear dimensionality reduction of noisy data is a challenging problem encountered in a variety of data analysis applications. Recent results in the literature show that spect...
Samuel Gerber, Tolga Tasdizen, Ross T. Whitaker
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
15 years 2 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher
DCC
2005
IEEE
16 years 2 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said