Sciweavers

69 search results - page 8 / 14
» Guaranteeing Practical Convergence in Algorithms for Sensor ...
Sort
View
JDCTA
2010
119views more  JDCTA 2010»
13 years 2 months ago
Distributed Dual Cluster Algorithm Based on Grid for Sensor Streams
In practical applications, Wireless Sensor Networks generate massive data streams with the dual attributes in geography and optimization domain. Energy source of sensor nodes in W...
Jianghua Huang, Junying Zhang
EMMCVPR
2003
Springer
14 years 25 days ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
14 years 2 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
OPODIS
2004
13 years 9 months ago
Fast Localized Delaunay Triangulation
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
Filipe Araújo, Luís Rodrigues
MOBIHOC
2010
ACM
13 years 5 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan