Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,733,657 papers from all fields of science
Search
Sign In
Create Free Account
Unordered associative containers (C++)
Known as:
Hash map (C++ class)
, Std::tr1::unordered map
, Unordered multiset (C++)
Expand
In the programming language C++, unordered associative containers are a group of class templates in the C++ Standard Library that implement hash…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Associative containers
C++
C++ Standard Library
C++ Technical Report 1
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Deep Reinforced Sequence-to-Set Model for Multi-Label Text Classification
Pengcheng Yang
,
Shuming Ma
,
Y. Zhang
,
Jun-Yang Lin
,
Qi Su
,
Xu Sun
arXiv.org
2018
Corpus ID: 52180576
Multi-label text classification (MLTC) aims to assign multiple labels to each sample in the dataset. The labels usually have…
Expand
2017
2017
Logical Foundations of Syllable Representations
Kristina Strother-Garcia
,
Jeffrey Heinz
2017
Corpus ID: 12020397
• Differences in notation do not necessarily entail differences in the information encoded in a particular formalism. • Fonts are…
Expand
2015
2015
Implementation of BT-trees
Lars F. Bonnichsen
,
Christian W. Probst
,
Sven Karlsson
arXiv.org
2015
Corpus ID: 2869712
This document presents the full implementation details of BT-trees, a highly efficient ordered map, and an evaluation which…
Expand
2014
2014
Exploiting Social Network Structure for Person-to-Person Sentiment Analysis (Supplementary Material to [WPLP14])
Robert West
,
Hristo S. Paskov
,
J. Leskovec
,
Christopher Potts
2014
Corpus ID: 264725669
Our definition of a triangle t = {e1,e2,e3} for an undirected signed graph G = (V,E,x) expresses each triangle as an unordered…
Expand
2014
2014
The efficiency of the A* algorithm’s implementations in selected programming languages
J. Klimaszewski
2014
Corpus ID: 59986224
This article presents results of the experiment, in which data structures, used by the A* algorithm (i.e. priority queue and hash…
Expand
2008
2008
Classification Using Unstructured Rules and Ant Colony Optimization
Negar Zakeri Nejad
,
Amir-Hossein Bakhtiary
,
M. Analoui
2008
Corpus ID: 501856
In this paper a new method based on the Ant-Miner algorithm is proposed to discover sets of unstructured classification rules…
Expand
Review
2003
Review
2003
Exploring the H-rep Ship Hull Modelling Concept
H. Koelman
2003
Corpus ID: 56354474
A novel ship hull modelling method, called hybrid representation (H-rep) was proposed some years ago. The aim of the H-rep method…
Expand
2001
2001
Incremental Codes
Yevgeniy Dodis
,
S. Halevi
RANDOM-APPROX
2001
Corpus ID: 29692744
We introduce the notion of incremental codes. Unlike a regular code of a given rate, which is an unordered set of elements with a…
Expand
1999
1999
MultiMAP/2: Netzzugang und Netzbetrieb fuer das multimediale Datenbanksystem MultiMAP
G. Specht
,
Martin Zirkel
1999
Corpus ID: 194608948
MultiMAP ist ein interaktives, multimediales Datenbanksystem, in dem Texte, Bilder, Audios und Videos einschliesslich beliebiger…
Expand
1965
1965
A lightpen-controlled program for online data analysis
J. Goodenough
Communications of the ACM
1965
Corpus ID: 14131936
This paper describes a technique designed to ease the use of a data processing system by a person, in particular, a scientist…
Expand