The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
direction-aware spatial keyword search method which inherently supports direction-aware search. We devise novel direction-aware indexing structures to prune unnecessary directions. We develop effective pruning techniques and search algorithms to efficiently answer a direction-aware query. As users may dynamically change their
In this study, we present a pre-filtering method for dynamic time warping (DTW) to improve the efficiency of a posteriorgram based keyword search (KWS) system. The ultimate aim is to improve the performance of a large vocabulary continuous speech recognition (LVCSR) based KWS system using the posteriorgram based KWS
Ranking solutions is an important issue in Information Retrieval because it greatly influences the quality of results. In this context, keyword based search approaches use to consider solutions sorting as least step of the overall process. Ranking and building solutions are completely separate steps running
Keyword search on (semi)structured databases is an increasingly popular research topic. But existing techniques do not deal well with the problems presented by the queries that are ambiguous. Recent approaches for RDF databases try to improve the quality of results by introducing an explicit top-k
Keywords can be used to query XML data without schema information. In this paper, a novel kind of query is proposed, top-k keyword search over XML streams. According to the set of keywords and the number of results, such query can retrieve the top-k XML data fragments most related to the keyword set. A novel ranking
Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is specified by a set of l keywords, {k1, k2, middot middot middot , kl}. It finds how the tuples that contain the
It is truly said by Michelangelo Antonisoni that “We live in a society that compels us to go on using the concepts, and we no longer know what they mean”. A central challenge in understanding the vital concepts of a thesis lies in the complexity of jargons. Our goal is to build an interactive Web application coupled with a chat interface to make learning or knowledge gaining easier. Thus our Web application...
Labeling schemes play crucial roles in the processing of XML queries. Designing labeling scheme that can support various common structural relationship queries (such as PC, AD, SR, DO, and LCA) among nodes, has received much research attention. Although there have existed a variety of labeling schemes such as prefix-based labeling, interval-based labeling and integer-based labeling and as well as...
Structured P2P systems can locate a resource by the unique identifier of the resource using distributed hash table. So users must know the identifier of a resource exactly to retrieve the resource in such systems. In addition, because of the variety and complexity of resources, a resource can not be described exactly and integrally only with an identifier, but needs multiple properties. Using metadata...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.