scispace - formally typeset
Search or ask a question
Topic

Association list

About: Association list is a research topic. Over the lifetime, 392 publications have been published within this topic receiving 7470 citations.


Papers
More filters
Proceedings ArticleDOI
01 Jan 1987
TL;DR: The order maintenance problem is that of maintaining a list under a sequence of Insert and Delete operations, while answering Order queries (determine which of two elements comes first in the list).
Abstract: The order maintenance problem is that of maintaining a list under a sequence of Insert and Delete operations, while answering Order queries (determine which of two elements comes first in the list). We give two new algorithms for this problem. The first algorithm matches the O(1) amortized time per operation of the best previously known algorithm, and is much simpler. The second algorithm permits all operations to be performed in O(1) worst-case time.

374 citations

Journal ArticleDOI
01 Sep 1989
TL;DR: This paper reports an exercise in generating a stop list for general text based on the Brown corpus of 1,014,000 words drawn from a broad range of literature in English, and generates a list of 421 stop words that should be maximally efficient and effective in filtering the most frequently occurring and semantically neutral words in general literature inEnglish.
Abstract: A stop list, or negative dictionary is a device used in automatic indexing to filter out words that would make poor index terms. Traditionally stop lists are supposed to have included only the most frequently occurring words. In practice, however, stop lists have tended to include infrequently occurring words, and have not included many frequently occurring words. Infrequently occurring words seem to have been included because stop list compilers have not, for whatever reason, consulted empirical studies of word frequencies. Frequently occurring words seem to have been left out for the same reason, and also because many of them might still be important as index terms.This paper reports an exercise in generating a stop list for general text based on the Brown corpus of 1,014,000 words drawn from a broad range of literature in English. We start with a list of tokens occurring more than 300 times in the Brown corpus. From this list of 278 words, 32 are culled on the grounds that they are too important as potential index terms. Twenty-six words are then added to the list in the belief that they may occur very frequently in certain kinds of literature. Finally, 149 words are added to the list because the finite state machine based filter in which this list is intended to be used is able to filter them at almost no cost. The final product is a list of 421 stop words that should be maximally efficient and effective in filtering the most frequently occurring and semantically neutral words in general literature in English.

365 citations

Patent
28 Feb 2007
TL;DR: In this paper, a system and method that facilitates and effectuates detection of malware secreted and/or hidden in plain sight on a machine is presented, in order to achieve its aims, generating a list of all loaded modules, identifying from the list a set of modules common to more than a threshold number of processes, and eliminating those modules included in an authentication list.
Abstract: A system and method that facilitates and effectuates detection of malware secreted and/or hidden in plain sight on a machine The system and method in order to achieve its aims generates a list of all loaded modules, identifies from the list a set of modules common to more than a threshold number of processes, and eliminates from the list those modules included in an authentication list The resultant list is prioritized based, in one instance, on the number of occurrences a particular module makes in the resultant list, and thereafter the list is distributed analyst workstations

259 citations

Patent
23 Jun 1998
TL;DR: In this article, the items on a list are sorted and ranges are derived from adjacent pairs of data items on the list, and then cryptographically manipulated data is generated from the plurality of ranges.
Abstract: Methods and apparatuses for providing cryptographic assurance based on ranges as to whether a particular data item is on a list. According to one computer-implemented method, the items on the list are sorted and ranges are derived from adjacent pairs of data items on the list. Next, cryptographically manipulated data is generated from the plurality of ranges. At least parts of the cryptographically manipulated data is transmitted onto a network for use in cryptographically demonstrating whether any given data item is on the list. According to another computer-implemented method, a request message is received requesting whether a given data item is on a list of data items. In response, a range is selected that is derived from the pair of data items on the list that define the smallest range that includes the given data item. A response message is transmitted that cryptographically demonstrates whether the first data item is on the list using cryptographically manipulated data derived from the range. According to another computer-implemented method, a request message requesting an indication as to whether a first data item is on a list of data items is transmitted. In response, a message is received that cryptographically demonstrates whether the first data item is on the list, where the response message identifies a range that is derived from the pair of data items on the list that defines the smallest range that includes the first data item.

183 citations

Patent
21 Aug 2001
TL;DR: In this article, the authors present a method to encode a list so users of the list may make queries to the coded list without the entire content of the entire list being revealed to the users.
Abstract: Systems and methods consistent with the present invention encode a list so users of the list may make inquires to the coded list without the entire content of the list being revealed to the users. Each item in the list turns on one or more bits in the array 110. Once each item in the list has been encoded by an encoder, a bit array with high and low values is used to represent the items in the list. The bit array may be embodied in a validation system for allowing users to query the list to determine whether an inquiry item is on the list 105. The validation system determines which bits to check by executing the same coding process executed by the encoder. If all the bits are high, then the inquiry item is determined to be part of the list, if at least one of the bits is low, then the inquiry item is determined not to be part of the original list. An exemplary encoder and validation system comprises a standardizer, a hashing function unit, an extraction circuit, and an offset circuit.

177 citations


Network Information
Related Topics (5)
Data structure
28.1K papers, 608.6K citations
68% related
Computer file
14.2K papers, 325.9K citations
67% related
String (computer science)
19.4K papers, 333.2K citations
67% related
Shared memory
18.7K papers, 355.1K citations
66% related
Programming paradigm
18.7K papers, 467.9K citations
66% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20191
201814
201714
20166
201512
201415