نتایج جستجو برای: ranking keywords
تعداد نتایج: 2006051 فیلتر نتایج به سال:
We study the development of conjunctive keyword searchable scheme which enables one to search encrypted documents by using more than one keyword. The notion of conjunctive keyword searching was presented by Golle et al. in 2004. However, their security model was constructed in a symmetric-key setting which is not applicable for the overall applications in the reality. So Park et al. extended Go...
In this paper we present several proofs on the extension of M. Riesz fractional integration and di¤erentiation to the contexts of spaces of homogeneous type and measure metric spaces with non-doubling measures. 1. Introduction, some de nitions, and a basic lemma Professor M. Ash asked me to write a survey article on some of the results that Stephen Vági and I obtained in the nineties on fractio...
Firms use different attribution strategies such as last-click attribution or first-click attribution to assign conversion credits to search keywords that appear in their consumers’ paths to purchase. These attributed credits impact a firm’s future bidding and budget allocations among keywords and, in turn, determine the overall return-on-investment of search campaigns. In this paper, we model t...
Firms use different attribution strategies such as last-click attribution or first-click attribution to assign conversion credits to search keywords that appear in their consumers’ paths to purchase. These attributed credits impact a firm’s future bidding and budget allocations among keywords and, in turn, determine the overall return-on-investment of search campaigns. In this paper, we model t...
In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed appr...
In this paper we present a method of decomposing a neutrosophic database relation with Neutrosophic attributes into basic relational form. Our objective is capable of manipulating incomplete as well as inconsistent information. Fuzzy relation or vague relation can only handle incomplete information. Authors are taking the Neutrosophic Relational database [8], [2] to show how imprecise data can ...
We present a ranking approach for Twitter documents that exploits social hashtagging behavior. We first map topics of user interest, represented by keywords, to a set of twitter hashtags that we use as query terms to retrieve twitter documents (tweets) based on tf-idf scores, with the additional restrictions that the documents retrieved should occur before the query timestamp. We show that this...
The BANKS system enables keyword-based search on databases, together with data and schema browsing. BANKS enables users to extract information in a simple manner without any knowledge of the schema or any need for writing complex queries. A user can get information by typing a few keywords, following hyperlinks, and interacting with controls on the displayed results. Extensive support for answe...
Evaluating the efficiency of decision making units has been frequently elaborated on in numerous publications. In this paper, the theoretical framework for a novel method of Distance Based Analysis (DBA) is presented. In addition, the method is performed on a sample of the ARWU’s top 54 Universities of the United States; the findings of which clearly demonstrate that the best ranked Universitie...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید