Some Results for Elementary Operations
نویسنده
چکیده
We present a number of results for elementary operations concerning the areas of data structures, computational geometry, graph algorithms and string algorithms. Especially, we focus on elementary operations like the dictionary operations, list manipulation, priority queues, temporal precedence, finger search, nearest common ancestors, negative cycle, 3-sided queries, rectangle enclosure, dominance searching, intersection queries, hidden line elimination and string manipulation.
منابع مشابه
Some rank equalities for finitely many tripotent matrices
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 page...
متن کاملTRIANGULAR FUZZY MATRICES
In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...
متن کاملReducing quantum computations to elementary unitary operations
27 Quantum computing has enormous potential for introducing fundamentally new capabilities to computational science and engineering, primarily through exponential parallelism.1,2 One of the many challenges in building practical quantum computers is to reduce a general quantum computation to some set of elementary operations that simple quantum devices can implement. By analogy, in the case of c...
متن کاملReduction of discrete linear repetitive processes to nonsingular Roesser models via elementary operations ?
A method based on the elementary operations algorithm (EOA) is developed that reduces a system matrix describing a discrete linear repetitive process to a 2-D nonsingular Roesser form such that all the input-output properties, including the transfer-function matrix, are preserved. Some areas for possible future use/application of the developed results will also be briefly discussed.
متن کاملRepresenting Independence Models with Elementary Triplets
In an independence model, the triplets that represent conditional independences between singletons are called elementary. It is known that the elementary triplets represent the independence model unambiguously under some conditions. In this paper, we show how this representation helps performing some operations with independence models, such as finding the dominant triplets or a minimal indepen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009