65 search results - page 9 / 13 » Reducing Computational Costs in the Basic Perturbation Lemma |
SASN
2003
ACM
14 years 2 months ago
2003
ACM
In this paper we address the problem of secure multicast of data streams over a multihop wireless ad hoc network. We propose a dynamic multicast group management protocol that aim...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
ICDCSW
2005
IEEE
14 years 2 months ago
2005
IEEE
In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover routes to a remote node via flood...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
— The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms...
ICANN
2007
Springer
14 years 26 days ago
2007
Springer
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...