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

Related topics

Related topics

9 relations
Associative containersC++C++ Standard LibraryC++ Technical Report 1
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Exploiting Social Network Structure for Person-to-Person Sentiment Analysis
Person-to-person evaluations are prevalent in all kinds of discourse and important for establishing reputations, building social… (More)
  • figure 1
  • figure 2
Is this relevant?
2014
2014
Results and conjectures on simultaneous core partitions
An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Unordered Associative Containers in STAPL
Unordered Associative Containers in STAPL. (May 2014) Tyler J. Biehle Department of Computer Science and Engineering Texas A&M… (More)
  • figure III
  • figure III
Is this relevant?
2012
2012
Image categorization using Fisher kernels of non-iid image models
The bag-of-words (BoW) model treats images as an unordered set of local regions and represents them by visual word histograms… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Best Proximity Sets and Equilibrium Pairs for a Finite Family of Multimaps
We establish the existence of a best proximity pair for which the best proximity set is nonempty for a finite family of multimaps… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The Pyramid Match Kernel: Efficient Learning with Sets of Features
In numerous domains it is useful to represent a single example by the set of the local features or parts that comprise it… (More)
Is this relevant?
2006
2006
A new version of the ant-miner algorithm discovering unordered rule sets
The Ant-Miner algorithm, first proposed by Parpinelli and colleagues, applies an ant colony optimization heuristic to the… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The pyramid match kernel: discriminative classification with sets of image features
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A Simple Approach to Ordinal Classification
Machine learning methods for classification problems commonly assume that the class values are unordered. However, in many… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach
In this paper, we present a new approach for word sense disambiguation (WSD) using an exemplar-based learning algorithm. This… (More)
Is this relevant?