The Experts below are selected from a list of 210 Experts worldwide ranked by ideXlab platform

D Khanna - One of the best experts on this subject based on the ideXlab platform.

  • a simple File Structure for the weighted dictionary problem
    Foundations of Software Technology and Theoretical Computer Science, 1993
    Co-Authors: Vijay K Vaishnavi, D Khanna
    Abstract:

    A new File Structure — weighted (a,b)-trees is proposed as a solution to the weighted dictionary problem. This File Structure is not only optimal (in the worst case), to within a constant factor, but is simple and elegant as well. Weighted (a,b)-trees use the same restructuring operations as the well known B-trees — SPLIT, MERGE, and SHIFT. Furthermore, weighted (a,b)-trees are likely to prove to be the first known solution to the dynamic weighted dictionary problem with a constant amortized rebalancing cost per update.

  • FSTTCS - A Simple File Structure for the Weighted Dictionary Problem
    Lecture Notes in Computer Science, 1993
    Co-Authors: Vijay K Vaishnavi, D Khanna
    Abstract:

    A new File Structure — weighted (a,b)-trees is proposed as a solution to the weighted dictionary problem. This File Structure is not only optimal (in the worst case), to within a constant factor, but is simple and elegant as well. Weighted (a,b)-trees use the same restructuring operations as the well known B-trees — SPLIT, MERGE, and SHIFT. Furthermore, weighted (a,b)-trees are likely to prove to be the first known solution to the dynamic weighted dictionary problem with a constant amortized rebalancing cost per update.

Vijay K Vaishnavi - One of the best experts on this subject based on the ideXlab platform.

  • a simple File Structure for the weighted dictionary problem
    Foundations of Software Technology and Theoretical Computer Science, 1993
    Co-Authors: Vijay K Vaishnavi, D Khanna
    Abstract:

    A new File Structure — weighted (a,b)-trees is proposed as a solution to the weighted dictionary problem. This File Structure is not only optimal (in the worst case), to within a constant factor, but is simple and elegant as well. Weighted (a,b)-trees use the same restructuring operations as the well known B-trees — SPLIT, MERGE, and SHIFT. Furthermore, weighted (a,b)-trees are likely to prove to be the first known solution to the dynamic weighted dictionary problem with a constant amortized rebalancing cost per update.

  • FSTTCS - A Simple File Structure for the Weighted Dictionary Problem
    Lecture Notes in Computer Science, 1993
    Co-Authors: Vijay K Vaishnavi, D Khanna
    Abstract:

    A new File Structure — weighted (a,b)-trees is proposed as a solution to the weighted dictionary problem. This File Structure is not only optimal (in the worst case), to within a constant factor, but is simple and elegant as well. Weighted (a,b)-trees use the same restructuring operations as the well known B-trees — SPLIT, MERGE, and SHIFT. Furthermore, weighted (a,b)-trees are likely to prove to be the first known solution to the dynamic weighted dictionary problem with a constant amortized rebalancing cost per update.

Naphtali Rishe - One of the best experts on this subject based on the ideXlab platform.

  • A File Structure for semantic databases
    Information Systems, 1991
    Co-Authors: Naphtali Rishe
    Abstract:

    Abstract This paper presents a highly-efficient File Structure for the storage of semantic databases. A low-level access language is presented, such that an arbitrary query can be performed as one or several elementary queries of the language. Most elementary queries, including such non-trivial queries as range queries and others, can be performed in just one single access to the disk.

Yang Qiu-xiang - One of the best experts on this subject based on the ideXlab platform.

  • Unknown Virus Detection Based on Exceptional PE File Structure
    Computer Technology and Development, 2009
    Co-Authors: Yang Qiu-xiang
    Abstract:

    Behavior-based analysis of currently unknown virus detection methods,necessary to run an executable File can be detected after,can not be detected in static form of computer virus File.In this paper,a document based on the static unknown virus detection of new technologies,by analyzing the PE File Structure of the abnormal value,the use of Bayesian methods and support vector machine to identify the static and non-static unknown virus.Compared to behavior-based analysis of the unknown virus detection methods,do not need to run the executable File in the case of the possibility to detect the virus File is unknown.The method is compared to API function call sequence based on the data mining method of virus detection methods,the documents do not need to shell deal with such complex calculations clearly improve the detection speed.Test results indicate that the method of the unknown virus detecter has faster detection speed,higher recognition rate and lower rate of misjudgment.

J. Reuter - One of the best experts on this subject based on the ideXlab platform.

  • Flavour Les Houches Accord: Interfacing Flavour related Codes
    Computer Physics Communications, 2012
    Co-Authors: F. Mahmoudi, S. Heinemeyer, A. Arbey, Aoife Bharucha, T. Goto, T. Hahn, U. Haisch, S. Kraml, M. Muhlleitner, J. Reuter
    Abstract:

    We present the Flavour Les Houches Accord (FLHA) which specifies a unique set of conventions for flavour-related parameters and observables. The FLHA uses the generic SUSY Les Houches Accord (SLHA) File Structure. It defines the relevant Standard Model masses, Wilson coefficients, decay constants, bag parameters, flavour observables, etc. The accord provides a universal and model-independent interface between codes evaluating and/or using flavour-related observables.

  • Flavour Les Houches Accord: Interfacing Flavour related Codes
    Computer Physics Communications, 2012
    Co-Authors: F. Mahmoudi, S. Heinemeyer, A. Arbey, Aoife Bharucha, T. Goto, T. Hahn, U. Haisch, S. Kraml, M. Muhlleitner, J. Reuter
    Abstract:

    Abstract We present the Flavour Les Houches Accord (FLHA) which specifies a set of conventions for flavour-related parameters and observables. The FLHA uses the generic SUSY Les Houches Accord (SLHA) File Structure. It defines the relevant Standard Model masses, Wilson coefficients, decay constants, bag parameters, flavour observables, etc. The accord provides a universal and model-independent interface between codes evaluating and/or using flavour-related observables.