Results 41 to 50 of about 3,382,176 (126)
Ecological Management &Restoration, Volume 27, Issue 3, September 2026.ABSTRACT In the complex interplay between agriculture and wildlife, free‐living predators pose a unique set of challenges. In western New South Wales (NSW), free‐living canids (legislatively defined as ‘wild dogs’; Canis familiaris; which currently includes dingoes, feral modern dogs and their hybrids) are managed due to their impacts on livestock ...
Deane Smith +5 more
wiley +1 more source
Hashing and its applications [PDF]
This tutorial discusses one of the oldest problems in computing: how to search and retrieve keyed information from a list in the least amount of time. Hashing -- a technique that mathematically converts a key into a storage address -- is one of the best ...
Lewis, Ted G., Cook, Curtis R.
core +2 more sources
Perfect class hashing and numbering for object-oriented implementation
, 2010 International audienceLate binding and subtyping create run-time overhead for object-oriented languages, especially in the context of both multiple inheritance and dynamic loading, for instance for JAVA interfaces.
Ducournau, Roland +3 more
core +1 more source
, 2008 We present an algorithm that computes a function that assigns consecutive integers to trees recognized by a deterministic, acyclic, finite-state, bottom-up tree automaton. Such function is called minimal perfect hashing.
Daciuk, Jan
core
A Dynamic Caching Algorithm based on C. C. Chang\u27s Ordered Minimal Perfect Hashing Scheme [PDF]
, 1987 An algorithm for storage and retrieval in a small dynamic cache is presented. This algorithm is based on C.C. Chang’s ordered minimal perfect hashing scheme.
Sager, Thomas J.
core
Comparison of Perfect Hashing Methods [PDF]
, 1999 This study was conducted to compare two minimal perfect hashing method Chang's method and Jaeschke's method. Since hashing is a widely used technique for store data in symbol table and the data are strings of characters, this study f use on the ...
Tao, Qizhi
core
Perfect hashing and related problems
, 2006 One of the most common tasks in many computer applications is the maintenance of a dictionary of words. The three most basic operations on the dictionary are find, insert, and delete.
Juvvadi, Ramana Rao
core
Finding succinct ordered minimal perfect hashing functions [PDF]
, 1992 An ordered minimal perfect hash table is one in which no collisions occur among a predefined set of keys, no space is unused, and the data are placed in the table in order. A new method for creating ordered minimal perfect hashing functions is presented.
Hirschberg, Daniel S., Seiden, Steven S.
core +1 more source
, 2023 In this paper, we analyze hashing from a worst-case perspective. To this end, we study a new property of hash families that is strongly related to d-perfect hashing, namely c-ideality.
Frei, Fabian, Wehner, David
core
Comparison of an algorithm and a heuristic for computing a best perfect hashing function [PDF]
Keywords and phrases: hashing function, injective function, simulation, memory access, scatter table, key-to-address transformation, perfect hashing1979 best estimate for issue date based on available ...
Lewis, Ted G., Kim, Seang Lin
core +1 more source