Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
AC0AF-heapAttribute–value pairB-tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Target tracking based on data fusion tree in intelligent space
This paper puts forward a novel method based on multilevel information fusion to realize the real-time target detection and… 
2012
2012
Sherlock Is Around: Detecting Network Failures with Local Evidence Fusion
Traditional approaches for wireless sensor network diagnosis are mainly sink-based. They actively collect global evidences from… 
Highly Cited
2011
Highly Cited
2011
Data Fusion with Desired Reliability in Wireless Sensor Networks
Energy-efficient and reliable transmission of sensory information is a key problem in wireless sensor networks. To save more… 
2010
2010
Multi-Attribute Data Fusion for Energy Equilibrium Routing in Wireless Sensor Networks
Data fusion is an attractive technology because it allows various trade-offs related to performance metrics, e.g., energy… 
2009
2009
A Study of Mobile Agent Tree Routes for Data Fusion in WSN
In mobile agent based data fusion, the order of nodes visited along the route by mobile agent has a significant impact on the… 
2009
2009
Evaluation methods for distributed multi-platform systems in electronic warfare and information-warfare related missions
The design of a Performance Evaluation (PE) process for any multi-sensor fusion-based system involves the design of a separate… 
2003
2003
On AC0 implementations of fusion trees and atomic heaps
Addressing a question of Fredman and Willard from STOC'90, we show that fusion trees cannot be implemented using the AC<sup>0… 
Highly Cited
1999
Highly Cited
1999
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
  • D. Willard
  • SIAM journal on computing (Print)
  • 1999
  • Corpus ID: 3249156
This article illustrates several examples of computer science problems whose performance can be improved with the use of either… 
1997
1997
When Can We Sort in o(n log n) Time?
  • Amir M. Ben-Amram
  • Journal of computer and system sciences (Print)
  • 1997
  • Corpus ID: 24479598
We define two conditions on a random access machine (RAM) with arithmetic and Boolean instructions and possible bounds on word… 
1992
1992
Applications of the fusion tree method to computational geometry and searching
a related loglogN improvement of Chazelle’s O(N logd-lN / log log N) space data structure [C86a], that performs the reporting… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)