نتایج جستجو برای: searching efficiency
تعداد نتایج: 436659 فیلتر نتایج به سال:
The importance of real-time pattern recognition in streaming media is rapidly growing (Liu, Wang, & Chen, 1998). Extracting information from audio and video streams in an e-collaboration scenario is getting increasing relevance as the networking infrastructure develops. This development enables the use of rich media content. Shared archives of this kind of knowledge need tools for exploration, ...
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encoding, quick sorting and ladderlike stepping and/or interval jumping techniques are applied. Since multiple sequence alignment of DNA sequences from the giant genomic database is usually time consuming, we develop a three...
Peer-to-peer computing is a popular paradigm for different applications that allow direct message passing among peers. The existing P2P search algorithms in MANET (Mobile Ad-hoc Network) are flooding-based search that produces much traffic and network overhead. File searching efficiency of peer-to-peer (P2P) network mainly depends on the reduction of message overhead. This paper deals with a fu...
We show that a cluster-skipping inverted index (CS-IIS) is a practical and efficient file structure to support category-restricted queries for searching Web directories. The query processing strategy with CS-IIS improves CPU time efficiency without imposing any limitations on the directory size.
QuiKey is an interaction approach that offers interactive fine grained access to structured information sources in a light weight user interface. It is designed to be highly interaction efficient for searching, browsing and authoring semantic knowledge bases as well as incrementally constructing complex queries. Empirical evaluation using a comparative GOMS Analysis and a user study confirm int...
In this paper we describe a new data structure that supports orthogonal range reporting queries on a set of points that move along linear trajectories on a U × U grid. The assumption that points lie on a U × U grid enables us to significantly decrease the query time in comparison to the standard kinetic model. Our data structure answers queries in O( √ logU/ log logU + k) time, where k denotes ...
The VTIR team participated in the Lifelog Semantic Access Task of the NTCIR-12 2016. We proposed an approach to pre-process the visual concepts of the photos and reconstruct queries from two aspects. Due to limited time, our efforts were constrained. Our main contribution was to learn and incorporate location of each photo to improve search accuracy. The evaluation demonstrated that our approac...
background: the iranian healthcare system is primarily an insurance based system. this structure has an important influence on the efficiency and equity of the provision of healthcare in iran. this paper reviews the history of the iranian healthcare system and the impact of the iranian health insurance system on healthcare performance based on the results of interviews with key opinion leaders ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید