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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2017
012319902017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A fusion system, which collects air-tracks from distributed radars and eliminates duplicated tracks, is required to get a Single… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2016
2016
This chapter addresses the problem of data gathering with multi-attribute fusion over a bandwidth and energy constrained wireless… (More)
Is this relevant?
2014
2014
The sorting problem is one of the most relevant problems in computer science. Within the scope of modern computer science it has… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
This paper puts forward a novel method based on multilevel information fusion to realize the real-time target detection and… (More)
  • figure 1
  • table I
Is this relevant?
2011
2011
Energy-efficient and reliable transmission of sensory information is a key problem in wireless sensor networks. To save more… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
In mobile agent based data fusion, the order of nodes visited along the route by mobile agent has a significant impact on the… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper presents a reliable multicast protocol (OTERS) that organizes receivers into a fusion tree that matches the multicast… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
1992
1992
a related loglogN improvement of Chazelle’s O(N logd-lN / log log N) space data structure [C86a], that performs the reporting… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Two algorithms are presented: a linear time algorithm for the minimum spanning tree problem and an O(m + n log n/log log n… (More)
Is this relevant?