71228 search results - page 345 / 14246 » Algorithms |
172
Voted
SSDBM
2008
IEEE
16 years 1 months ago
2008
IEEE
In order to establish consolidated standards in novel data mining areas, newly proposed algorithms need to be evaluated thoroughly. Many publications compare a new proposition – ...
175
Voted
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper proposes a fast blotch detection algorithm based on a Markov Random Field (MRF) model with less computational load and with lower false alarm rate than the existing MRF...
206
Voted
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the ...
183
click to vote
FCT
2007
Springer
16 years 1 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
180
Voted
HM
2007
Springer
16 years 1 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...