Index compression has been a major issue in the field of Information Retrieval Systems. In particular, due to the impressive figures involved with Web Search Engines (WSEs) the compression of the index is not an option anymore but it has become a must. The most important index compression methods are designed to work for Inverted File (IF) indexes. These methods are based on the assumption that...

We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficiently calculate, among other things, how the expert predictions should be weighted according to the model. We cast many existing models as HMMs and recover the best known running times in each case. We also describe two ne...

We calculate the doublet and quartet neutron-deuteron scattering lengths using a nonlocal nucleon-nucleon interaction fully derived from quark-quark interactions. We use as input the NN S0 and S1D1 partial waves. Our result for the quartet scattering length agrees well with the experimental value while the result for the doublet scattering length does not. However, if we take the result for the...

there are miscellaneous quality characteristics in healthcare which are interested to be monitored. however, monitoring each characteristic needs a special statistical method. there are some characteristics with very small incidence rates that it’s usually considered not to be necessary to monitoring them, since their incidence rates are so small that p and np charts are not able to monitor the...

We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computational complexity polynomial in the sentence length. This is done by adding a new subtree cloning operation to either tree-to-string or tree-to-tree alignment algorithms.