Skip to search formSkip to main contentSkip to account menu

Unordered associative containers (C++)

Known as: Hash map (C++ class), Std::tr1::unordered map, Unordered multiset (C++) 
In the programming language C++, unordered associative containers are a group of class templates in the C++ Standard Library that implement hash… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Associative containersC++C++ Standard LibraryC++ Technical Report 1

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Extracting Facts from Performance Tuning History of Scientific Applications for Predicting Effective Optimization Patterns
To improve performance of large-scale scientific applications, scientists or tuning experts make various empirical attempts to… 
2013
2013
Fast scalable selection algorithms for large scale data
Selection finding, and its most common form median finding, are used as a measure of central tendency for problems in biology… 
2011
2011
Biometric template security using fuzzy vault
Theft of a template is theft of identity Fingerprint identification is used by forensic department in identifying criminals… 
2011
2011
Compressing Feature Sets with Digital Search Trees
State-of-the-art image retrieval pipelines are based on “bag-of-words” matching. We note that the original order in which… 
Highly Cited
2010
Highly Cited
2010
Multi-agent path planning with multiple tasks and distance constraints
The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a… 
2007
2007
User - Profile based Communities Assessment using Clustering Methods
In this paper, we introduce and evaluate a framework for a user profile-based socializing application. We model the user profile… 
1994
1994
Applying Bayesian networks to fault diagnosis
Diagnosis applications relying on artificial intelligence methods must deal with uncertain knowledge and fuzzy input data… 
1980
1980
On the Complexity of Searching a Set of Vectors
  • D. Hirschberg
  • SIAM journal on computing (Print)
  • 1980
  • Corpus ID: 29507676
The vector searching problem is, given k-vector A (a k-vector is a vector that has k components, over the integers) and given a… 
Highly Cited
1975
Highly Cited
1975
On the synthesis of linear control systems with specified characteristics
  • J. Ackermann
  • at - Automatisierungstechnik
  • 1975
  • Corpus ID: 40173248
Highly Cited
1973
Highly Cited
1973
Storage and later recognition of exemplars of concepts
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)