Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Fusion tree

In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers. When operating on a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Traditional approaches for wireless sensor network diagnosis are mainly sink-based. They actively collect global evidences from… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2011
Highly Cited
2011
Energy-efficient and reliable transmission of sensory information is a key problem in wireless sensor networks. To save more… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
2009
2009
  • Yuzhi Wu, L. Cheng
  • WRI International Conference on Communications…
  • 2009
  • Corpus ID: 18786079
In mobile agent based data fusion, the order of nodes visited along the route by mobile agent has a significant impact on the… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
2005
2005
  • T. Martin, K. Chang
  • 7th International Conference on Information…
  • 2005
  • Corpus ID: 14674322
This paper establishes a distributed data fusion method for ad hoc networks, enabling each device or agent to operate… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 5
2003
2003
Addressing a question of Fredman and Willard from STOC'90, we show that fusion trees cannot be implemented using the AC<sup>0… Expand
Highly Cited
2000
Highly Cited
2000
This article illustrates several examples of computer science problems whose performance can be improved with the use of either… Expand
1997
1997
We define two conditions on a random access machine (RAM) with arithmetic and Boolean instructions and possible bounds on word… Expand
Highly Cited
1993
Highly Cited
1993
Abstract This paper introduces a new sublogarithmic data structure for searching, the fusion tree. These trees lead to improved… Expand
1992
1992
a related loglogN improvement of Chazelle’s O(N logd-lN / log log N) space data structure [C86a], that performs the reporting… Expand
Highly Cited
1990
Highly Cited
1990
The fusion tree method is extended to develop a linear-time algorithm for the minimum spanning tree problem and an O(m+n log n… Expand