Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
differentiated privacy preservation in the presence of multi-keyword document search. The differentiation is necessary as terms and phrases bear innate differences in their semantic meanings. In this paper, we present <sc>$\epsilon
The so-called filler or garbage Hidden Markov Models (HMM) are among the most widely used models for lexicon-free, query by string key word spotting in the fields of speech recognition and (lately) handwritten text recognition. An important drawback of this approach is the large computational cost of the keyword
components rather than a single Database table. So to minimise the time constraint, memory space and to do a smart search a new IR system is introduced. In the proposed system, searches can be divided into three categorise, namely (i) Main topic search (ii) Subtitle search and (iii) Keyword search. So the system would search
In the past few years, videos become an ordinary communication mean for both personal and business activities. Not only the keyword search that have been utilized widely, but also the video content-based search, i.e. given a query video, the similar video sequences can be retrieved. Meanwhile, the increasing of the
expansion. Wu-Palmer similarity model is applied in retrieving the output from the database. The output shows that expanded query produces better results in terms of qualitative & quantitative rather than unexpanded query. Query expansion increases the number of keywords which help in fetching similar patents. The results of
mechanism to create a codebook with low network cost. Since the number of features in each image is large, compared to a text query generally consisting of several keywords, information exchange between nodes for each query image generates high network cost. In order to further reduce the network cost, we implement two static
its relevance. During search, we retrieve similar images containing the correct keywords for a given target image. For example, we prioritize images where extracted objects of interest from the target images are dominant as it is more likely that words associated with the images describe the objects. We tailored our
term-by-document matrix, it inevitably loses the information of relations between query terms in the document in the first place. This paper presents a modified vector space model for measuring similarity between the query and the document when responding to a multi-term query. More weight is assigned to the keywords
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.