Merging the outputs of different search engines or information sources in response to a query has been shown to improve performance. In most cases, scores produced by different information sources are not comparable: merging techniques are often segregated into a score normalization step followed by a combination step. The Combination step is usually straight forward and has been an area of act...

In this paper we show how an exploratory search process, specifically the Preference-enriched Faceted Search (PFS) process, can be enriched for exploring datasets that also contain geographic information. In the introduced extension, that we call PFSgeo, the objects can have geographical coordinates, the interaction model is extended, and the web-interface is enriched with a map which the user ...

Automatic text categorization has become a vital topic in many applications. Imagine for example the automatic classi cation of Internet pages for a search engine database. The traditional 1-of-n output coding for classi cation scheme needs resources increasing linearly with the number of classes. A di erent solution uses an error correcting code, increasing in length with O(log2(n)) only. In t...

The computational cost of a large-vocabulary continuous speech recognition system based on HMM is proportional to its vocabulary size. A tree-structured lexicon is generally used to reduce the number of HMM states. An approximation of the dependence of word boundaries and likelihoods on word histories is also used to limit the increase in the number of hypotheses in the forward decoding procedu...

University timetabling is an issue that has received more attention in the field of operations research. Course scheduling process arranging time slots and room for a class by paying to existing limitations. This problem NP-Hard problem, which means computation find solution increases exponentially with size problem. Solutions problems this kind generally use heuristic approach, tries sufficien...

We present two efficient search algorithms for real-time spoken language systems. The first called the Word-Dependent N-Best algorithm is an improved algorithm for finding the top N sentence hypotheses. The new algorithm is shown to perform as well as the Exact Sentence-Dependent algorithm presented previously but with an order of magnitude less computation. The second algorithm is a fast match...

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...