Sciweavers

4110 search results - page 167 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
TASLP
2002
67views more  TASLP 2002»
15 years 4 months ago
Efficient tracking of the cross-correlation coefficient
In many (audio) processing algorithms, involving manipulation of discrete-time signals, the performance can vary strongly over the repertoire that is used. This may be the case whe...
Ronald M. Aarts, Roy Irwan, Augustus J. E. M. Jans...
TON
2002
86views more  TON 2002»
15 years 4 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
ICIP
2009
IEEE
15 years 2 months ago
Selecting representative and distinctive descriptors for efficient landmark recognition
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
Sheng Gao, Joo-Hwee Lim
BIBM
2009
IEEE
190views Bioinformatics» more  BIBM 2009»
15 years 2 months ago
A Fast, Semi-automatic Brain Structure Segmentation Algorithm for Magnetic Resonance Imaging
Abstract--Medical image segmentation has become an essential technique in clinical and research-oriented applications. Because manual segmentation methods are tedious, and fully au...
Kevin Karsch, Qing He, Ye Duan
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 6 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking