Sciweavers

153 search results - page 10 / 31
» Approximating node connectivity problems via set covers
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 3 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
JCP
2008
121views more  JCP 2008»
13 years 8 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
INFOCOM
2012
IEEE
11 years 11 months ago
A robust boundary detection algorithm based on connectivity only for 3D wireless sensor networks
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate th...
Hongyu Zhou, Hongyi Wu, Miao Jin
ALGOSENSORS
2006
Springer
14 years 9 days ago
Area Based Beaconless Reliable Broadcasting in Sensor Networks
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...
Francisco Javier Ovalle-Martínez, Amiya Nay...
DEXA
2009
Springer
153views Database» more  DEXA 2009»
14 years 13 days ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...