Results 231 to 240 of about 658,036 (261)
Some of the next articles are maybe not open access.
International Journal of Foundations of Computer Science, 1993
When searching for an item x in a dictionary, let t be the number of distinct items referenced since the previous reference to x. The move-to-front-list is a widely known dictionary data structure that supports searches on x in O(t) time. We present a new selforganizing data structure, called the Historical Search Tree, which supports the search in O(
Alistair Moffat, Ola Petersson
openaire +1 more source
When searching for an item x in a dictionary, let t be the number of distinct items referenced since the previous reference to x. The move-to-front-list is a widely known dictionary data structure that supports searches on x in O(t) time. We present a new selforganizing data structure, called the Historical Search Tree, which supports the search in O(
Alistair Moffat, Ola Petersson
openaire +1 more source
SIAM Journal on Computing, 1985
We investigate the complexity of searching a sorted table of n elements on a synchronous, shared memory parallel computer with p processors. We show that \(\Omega\) (lg n-lg p) steps are required if concurrent accesses to the same memory cell are not allowed, whereas O(lg n/lg p) steps are sufficient if simultaneous reads are allowed.
openaire +2 more sources
We investigate the complexity of searching a sorted table of n elements on a synchronous, shared memory parallel computer with p processors. We show that \(\Omega\) (lg n-lg p) steps are required if concurrent accesses to the same memory cell are not allowed, whereas O(lg n/lg p) steps are sufficient if simultaneous reads are allowed.
openaire +2 more sources
Artificial Intelligence, 1981
Abstract The problem of concept learning, or forming a general description of a class of objects given a set of examples and non-examples, is viewed here as a search problem. Existing programs that generalize from examples are characterized in terms of the classes of search strategies that they employ.
openaire +1 more source
Abstract The problem of concept learning, or forming a general description of a class of objects given a set of examples and non-examples, is viewed here as a search problem. Existing programs that generalize from examples are characterized in terms of the classes of search strategies that they employ.
openaire +1 more source
2004
Participatory search can be defined as a search service framework where each participant takes care of gathering information and contributing indexes to a central location where the indexes are integrated and deployed for running a search service. Participatory search has distinguishing characteristics with respect to other search service architectures,
ATTARDI, GIUSEPPE +3 more
openaire +2 more sources
Participatory search can be defined as a search service framework where each participant takes care of gathering information and contributing indexes to a central location where the indexes are integrated and deployed for running a search service. Participatory search has distinguishing characteristics with respect to other search service architectures,
ATTARDI, GIUSEPPE +3 more
openaire +2 more sources
Forensic investigation approaches of searching relatives in DNA databases
Journal of Forensic Sciences, 2021Jianye Ge, Bruce Budowle
exaly