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

Heaps' law

Known as: Heaps law, Herdan's law 
In linguistics, Heaps' law (also called Herdan's law) is an empirical law which describes the number of distinct words in a document (or set of… Expand
Wikipedia

Related topics

Related topics

6 relations
Clustering high-dimensional dataFeature hashingLanguage modelText corpus
Expand

Broader (1)

Computational linguistics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Soil carbon development in rejuvenated Indian coal mine spoil
Abstract The impact of mine spoil on the landscape is significant, as excavated rock-debris is commonly disposed in heaps that… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
An application of the plant functional group concept to restoration practice on coal mine spoil heaps
The history of coal mining in South Poland has left a legacy of many spoil heaps across the landscape. These have presented the… Expand
  • table 1
  • figure 1
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
Persistent, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Popular myths around soil fertility management in sub-Saharan Africa
The aim of this paper is to demystify some of the popular myths related to tropical soil fertility management that have gained… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 4
Is this relevant?
2005
2005
Towards a final analysis of pairing heaps
  • Seth Pettie
  • 46th Annual IEEE Symposium on Foundations of…
  • 2005
    • Corpus ID: 2717102
Fredman, Sedgewick, Sleator and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Cell division in diatoms
Publisher Summary This chapter describes mitosis in diatoms and explores how the observations and inferences from these cells… Expand
  • figure 2
  • figure 7
  • figure 10
  • figure 12
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Reconsidering custom memory allocation
Programmers hoping to achieve performance improvements often use custom memory allocators. This in-depth study examines eight… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2002
2002
Meldable heaps and boolean union-find
In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations find-min, insert… Expand
Is this relevant?
2000
2000
Fast priority queues for cached memory
The cache hierarchy prevalent in todays high performance processors has to be taken into account in order to design algorithms… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap—a sequence… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE