Sciweavers

2194 search results - page 17 / 439
» Improving HLRTA*( k )
Sort
View
103
Voted
MCS
2004
Springer
15 years 6 months ago
Dynamic Classifier Selection by Adaptive k-Nearest-Neighbourhood Rule
Despite the good results provided by Dynamic Classifier Selection (DCS) mechanisms based on local accuracy in a large number of applications, the performances are still capable of ...
Luca Didaci, Giorgio Giacinto
67
Voted
APPROX
2008
Springer
91views Algorithms» more  APPROX 2008»
15 years 2 months ago
Improved Separations between Nondeterministic and Randomized Multiparty Communication
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...
Matei David, Toniann Pitassi, Emanuele Viola
110
Voted
ICPR
2002
IEEE
16 years 1 months ago
Rejection Strategies and Confidence Measures for a k- NN Classifier in an OCR Task
In Handwritten Character Recognition, the rejection of extraneous patterns, like image noise, strokes or corrections, can improve significantly the practical usefulness of a syste...
Javier Cano, Joaquim Arlandis, Juan Carlos P&eacut...
83
Voted
ICC
2009
IEEE
111views Communications» more  ICC 2009»
15 years 7 months ago
A Study of the Percolation Threshold for k-Collaborative Wireless Networks
—How to efficiently use the air interface is a crucial issue in wireless networks. In order to improve the performance, mechanisms have been proposed to improve the reach and th...
Cédric Westphal
74
Voted
ICPR
2004
IEEE
16 years 1 months ago
Outlier Detection Using k-Nearest Neighbour Graph
We present an Outlier Detection using Indegree Number (ODIN) algorithm that utilizes k-nearest neighbour graph. Improvements to existing kNN distance -based method are also propos...
Ismo Kärkkäinen, Pasi Fränti, Ville...