Distributed node counting in wireless sensor networks in the presence of communication noise
Distributed node counting in wireless sensor networks can be important in various
applications, such as network maintenance and information aggregation. In this paper, a …
applications, such as network maintenance and information aggregation. In this paper, a …
Interactive knowledge graph querying through examples and facets
Y Amsterdamer, L Gáspár - … Conference on Advances in Databases and …, 2022 - Springer
Abstract Knowledge graphs are a highly useful form of information representation. To assist
end users in understanding the contents of a given graph, multiple lines of research have …
end users in understanding the contents of a given graph, multiple lines of research have …
[图书][B] Distributed network structure estimation using consensus methods
The area of detection and estimation in a distributed wireless sensor network (WSN) has
several applications, including military surveillance, sustainability, health monitoring, and …
several applications, including military surveillance, sustainability, health monitoring, and …
Optimal embedding of functions for in-network computation: Complexity analysis and algorithms
P Vyavahare, N Limaye… - IEEE/ACM Transactions …, 2015 - ieeexplore.ieee.org
We consider optimal distributed computation of a given function of distributed data. The input
(data) nodes and the sink node that receives the function form a connected network that is …
(data) nodes and the sink node that receives the function form a connected network that is …
Lower bounds for in-network computation of arbitrary functions
In this paper, we provide a family of bounds for the rate at which the functions of many inputs
can be computed in-network on general topologies. Going beyond simple symmetric …
can be computed in-network on general topologies. Going beyond simple symmetric …
Cramer-rao bounds for distributed system size estimation using consensus algorithms
System size estimation in distributed wireless sensor networks is important in various
applications such as network management and maintenance. One popular method for …
applications such as network management and maintenance. One popular method for …
Graph codes for distributed instant message collection in an arbitrary noisy broadcast network
We consider the problem of minimizing the number of broadcasts for collecting all sensor
measurements at a sink node in a noisy broadcast sensor network. Focusing first on …
measurements at a sink node in a noisy broadcast sensor network. Focusing first on …
On the maximum rate of networked computation in a capacitated network
We are given a capacitated communication network and several infinite sequences of
source data each of which is available at some node in the network. A function of the source …
source data each of which is available at some node in the network. A function of the source …
Random walk based in-network computation of arbitrary functions
We study in-network computation on general network topologies. Specifically, we are given
the description of a function, and a network with distinct nodes at which the operands of the …
the description of a function, and a network with distinct nodes at which the operands of the …
Check for Interactive Knowledge Graph Querying Through Examples and Facets Yael Amsterdamer () and Laura Gáspár Bar-Ilan University, Ramat Gan, Israel
IKG Querying - New Trends in Database and Information …, 2022 - books.google.com
Yael Amsterdamer () and Laura Gáspár Bar-Ilan University, Ramat Gan, Israel yael.
amsterdamer@ biu. ac. il Abstract. Knowledge graphs are a highly useful form of information …
amsterdamer@ biu. ac. il Abstract. Knowledge graphs are a highly useful form of information …