FAQ

Weak heap

A weak heap is a variation of the a binary heap data structure.
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
020406019382016

Related topics

Related topics

6 relations
Binary heapBinary treeFibonacci heapHeap (data structure)
(More)

Related mentions per year

Related mentions per year

1939-2018
19401960198020002020
Weak heap
Binary tree
Priority queue
Heap (data structure)
Binary heap
Fibonacci heap

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The weak-heap data structure: Variants and applications
The weak heap is a priority queue that was introduced as a competitive structure for sorting. Its array-based form supports the… (More)
  • figure 1
  • figure 9
  • figure 10
  • table 1
  • figure 11
Is this relevant?
2012
2012
The Weak-Heap Family of Priority Queues in Theory and Praxis
In typical applications, a priority queue is used to execute a sequence of n insert , m decrease, and n delete-min operations… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Multi-Label Learning with Weak Label
Multi-label learning deals with data associated with multiple labels simultaneously. Previous work on multi-label learning… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Jamming-resistant Broadcast Communication without Shared Keys
Jamming-resistant broadcast communication is crucial for safety-critical applications such as emergency alert broadcasts or the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Clustering ensembles: models of consensus and weak partitions
Clustering ensembles have emerged as a powerful method for improving both the robustness as well as the stability of unsupervised… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Modeling and Verification of Reactive Systems using Rebeca
Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Computational Mechanics: Pattern and Prediction, Structure and Simplicity
IV Computational Mechanics 9 A Causal States . . . . . . . . . . . . . . 9 Causal States of a Process Defined . . . 9 1 Morphs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1993
1993
Improved bounds on weak epsilon-nets for convex sets
Let S be a set Micha Sharir~ of n points in JRd. A set W is a weak c-net for (convex ranges of) S if for any T ~ S containing m… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential… (More)
  • figure 2
  • figure 3
Is this relevant?