240 search results - page 5 / 48 » Efficient Variants of the Backward-Oracle-Matching Algorithm |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Linguistic steganography, as a method of text steganography, is becoming a hot spot. To investigate the linguistic steganography for Chinese text, A Chinese linguistic steganograp...
GECCO
2004
Springer
14 years 25 days ago
2004
Springer
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
ACL
2010
13 years 5 months ago
2010
We propose a top-down algorithm for extracting k-best lists from a parser. Our algorithm, TKA is a variant of the kbest A (KA) algorithm of Pauls and Klein (2009). In contrast to ...