Sciweavers

3172 search results - page 125 / 635
» New developments of the Z-EDM algorithm
Sort
View
JAT
2007
84views more  JAT 2007»
15 years 3 months ago
On Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
IDA
2003
Springer
15 years 9 months ago
Clustering Mobile Trajectories for Resource Allocation in Mobile Environments
The recent developments in computer and communication technologies gave rise to Personal Communication Systems. Due to the nature of the PCS, the bandwidth allocation problem arise...
Dimitrios Katsaros, Alexandros Nanopoulos, Murat K...
134
Voted
ICML
2006
IEEE
16 years 4 months ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li
GIS
2010
ACM
15 years 2 months ago
Cleaning massive sonar point clouds
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
Lars Arge, Kasper Green Larsen, Thomas Mølh...
FOCS
1995
IEEE
15 years 7 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth