標(biāo)題: Titlebook: Distributed Multimedia Information Retrieval; SIGIR 2003 Workshop Jamie Callan,Fabio Crestani,Mark Sanderson Conference proceedings 2004 S [打印本頁(yè)] 作者: Enlightening 時(shí)間: 2025-3-21 20:08
書目名稱Distributed Multimedia Information Retrieval影響因子(影響力)
書目名稱Distributed Multimedia Information Retrieval影響因子(影響力)學(xué)科排名
書目名稱Distributed Multimedia Information Retrieval網(wǎng)絡(luò)公開(kāi)度
書目名稱Distributed Multimedia Information Retrieval網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Distributed Multimedia Information Retrieval被引頻次
書目名稱Distributed Multimedia Information Retrieval被引頻次學(xué)科排名
書目名稱Distributed Multimedia Information Retrieval年度引用
書目名稱Distributed Multimedia Information Retrieval年度引用學(xué)科排名
書目名稱Distributed Multimedia Information Retrieval讀者反饋
書目名稱Distributed Multimedia Information Retrieval讀者反饋學(xué)科排名
作者: locus-ceruleus 時(shí)間: 2025-3-22 00:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281925.jpg作者: 音樂(lè)學(xué)者 時(shí)間: 2025-3-22 01:16
https://doi.org/10.1007/b95004Distribution; LA; Multimedia; algorithms; architecture; data fusion; digital libraries; distributed image r作者: Foment 時(shí)間: 2025-3-22 08:19
978-3-540-20875-4Springer-Verlag Berlin Heidelberg 2004作者: 周年紀(jì)念日 時(shí)間: 2025-3-22 12:13 作者: Nebulous 時(shí)間: 2025-3-22 14:35 作者: Nebulous 時(shí)間: 2025-3-22 19:11 作者: OTHER 時(shí)間: 2025-3-23 01:03
The Commonwealth of the Bahamasies a query should be routed. In this paper, we describe a novel technique that is used in the MIND project. Our approach, decision-theoretic framework (DTF), differs from existing algorithms like CORI in two ways: It computes a selection which minimises the overall costs (e.g. retrieval quality, ti作者: CESS 時(shí)間: 2025-3-23 04:20 作者: agnostic 時(shí)間: 2025-3-23 06:45 作者: brachial-plexus 時(shí)間: 2025-3-23 13:00 作者: allergy 時(shí)間: 2025-3-23 16:28
https://doi.org/10.1057/9780230271173ditions necessary for fusion to improve retrieval have not been identified, it is widely believed that as long as component result sets used in fusion have higher relevant overlap than non-relevant overlap, improvements due to fusion can be observed. We show that this is not the case when systemic d作者: Incise 時(shí)間: 2025-3-23 21:04 作者: 分散 時(shí)間: 2025-3-24 00:30 作者: Expertise 時(shí)間: 2025-3-24 06:14
The Commonwealth of the Bahamas results from other users are taken into consideration. In order to resolve this anonymity towards the search engine, a system is created which locally stores the search results in the scope of a peer-to-peer network. Using the Peer Search Memory (PeerSy) all relevant results are stored and associat作者: Noisome 時(shí)間: 2025-3-24 07:10
https://doi.org/10.1057/9780230271173 envisages a DL additionally as a personalized collaborative working and meeting space of people sharing common interests, where users . may organize the information space according to their own subjective view; . may build communities, . may become aware of each other, . may exchange information an作者: 比喻好 時(shí)間: 2025-3-24 13:38
Distributed Multimedia Information Retrieval978-3-540-24610-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 呼吸 時(shí)間: 2025-3-24 17:30 作者: LINE 時(shí)間: 2025-3-24 21:20
Collection Fusion for Distributed Image Retrievalo one or more formats such that each library can process the query. Finally, data fusion is used to gather all retrieved documents and conveniently arrange them for presentation to the user..In this paper, we introduce an original framework for collection fusion in the context of image databases. In作者: HUMP 時(shí)間: 2025-3-25 01:21 作者: minaret 時(shí)間: 2025-3-25 03:41
0302-9743 the topic to round off coverage of the core issues. The papers are devoted to recent research on the design and implementation of methods and tools for resource discovery, resource description, resource selection, data fusion, and user interaction..978-3-540-20875-4978-3-540-24610-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 閑逛 時(shí)間: 2025-3-25 08:22 作者: 使成核 時(shí)間: 2025-3-25 13:11
The Commonwealth of the Bahamaso one or more formats such that each library can process the query. Finally, data fusion is used to gather all retrieved documents and conveniently arrange them for presentation to the user..In this paper, we introduce an original framework for collection fusion in the context of image databases. In作者: opportune 時(shí)間: 2025-3-25 17:00
Harvesting: Broadening the Field of Distributed Information Retrievalfor distributed IR. We highlight the use of the Open Archives Initiative Protocol for Metadata Harvesting, illustrating its use in three projects: OAD, NDLTD, and CITIDEL. We explain how traditional services can be extended in a user-centered fashion, providing details of our new: ESSEX search engin作者: diskitis 時(shí)間: 2025-3-25 21:41
Using Query Probing to Identify Query Language Features on the Webically probes the resource’s search interface with a set of selected probe queries and analyzes the returned pages to recognize supported query language features. The automatic discovery assumes that the number of matches a server returns for a submitted query is available on the first result page. 作者: FLIRT 時(shí)間: 2025-3-26 00:12 作者: HALL 時(shí)間: 2025-3-26 05:18
Decision-Theoretic Resource Selection for Different Data Types in MINDies a query should be routed. In this paper, we describe a novel technique that is used in the MIND project. Our approach, decision-theoretic framework (DTF), differs from existing algorithms like CORI in two ways: It computes a selection which minimises the overall costs (e.g. retrieval quality, ti作者: BRUNT 時(shí)間: 2025-3-26 10:26
Distributed Web Search as a Stochastic Gameetasearchers distribute user’s queries to only the most suitable search engines. Previous research has investigated methods for engine selection and merging of search results (i.e. performance improvements from the user’s perspective). We focus instead on performance from the service provider’s poin作者: Banister 時(shí)間: 2025-3-26 13:13 作者: 邊緣帶來(lái)墨水 時(shí)間: 2025-3-26 19:59 作者: Affable 時(shí)間: 2025-3-26 23:26
Recent Results on Fusion of Effective Retrieval Strategies in the Same Information Retrieval Systemditions necessary for fusion to improve retrieval have not been identified, it is widely believed that as long as component result sets used in fusion have higher relevant overlap than non-relevant overlap, improvements due to fusion can be observed. We show that this is not the case when systemic d作者: Ascendancy 時(shí)間: 2025-3-27 01:46
The MIND Architecture for Heterogeneous Multimedia Federated Digital Librarieson-co-operating digital libraries and gives the user the impression of a single coherent system. The architecture consists of a single mediator and one proxy (composed of several proxy components) for every connected library. These specialised, distributed components are connected via SOAP. This arc作者: artless 時(shí)間: 2025-3-27 06:27 作者: 我們的面粉 時(shí)間: 2025-3-27 10:13
Towards Virtual Knowledge Communities in Peer-to-Peer Networks results from other users are taken into consideration. In order to resolve this anonymity towards the search engine, a system is created which locally stores the search results in the scope of a peer-to-peer network. Using the Peer Search Memory (PeerSy) all relevant results are stored and associat作者: 蜿蜒而流 時(shí)間: 2025-3-27 17:32 作者: MEN 時(shí)間: 2025-3-27 20:45
https://doi.org/10.1057/9780230271173hermore, our experiments have shown that the ratio of relevant to non-relevant overlap is a poor indicator of the likelihood of fusion’s effectiveness, and we propose an alternate hypothesis of what needs to happen in order for fusion to improve retrieval when standard voting/merging algorithms such as CombMNZ are employed.作者: GILD 時(shí)間: 2025-3-27 23:34 作者: maverick 時(shí)間: 2025-3-28 06:03 作者: Muffle 時(shí)間: 2025-3-28 09:25 作者: 能量守恒 時(shí)間: 2025-3-28 11:21
Conference proceedings 2004ed for a variety of professional and private user communities. As digital data collections proliferate, problems of resource selection and data fusion become major issues. Traditional search engines, even the best ones, are unable to provide access to the hidden web of information that is only avail作者: AV-node 時(shí)間: 2025-3-28 16:42
The British Commonwealth and Empires that demonstrate the suitability of our approach. Our approach has relatively low costs, because only a small set of resources has to be inspected manually to create a training set for the machine learning algorithm.作者: GRIEF 時(shí)間: 2025-3-28 22:37 作者: heckle 時(shí)間: 2025-3-29 00:53 作者: 大罵 時(shí)間: 2025-3-29 03:26
Using Query Probing to Identify Query Language Features on the Webs that demonstrate the suitability of our approach. Our approach has relatively low costs, because only a small set of resources has to be inspected manually to create a training set for the machine learning algorithm.作者: 甜食 時(shí)間: 2025-3-29 11:08
The Effect of Database Size Distribution on Resource Selection Algorithmslection algorithm. Experiments were done on four testbeds with different characteristics, and the ReDDE and the extended KL divergence resource selection algorithm have been shown to be more robust in various environments.作者: 混合 時(shí)間: 2025-3-29 12:25
Apoidea: A Decentralized Peer-to-Peer Architecture for Crawling the World Wide Web2P) crawler called Apoidea, which is self-managing and uses geographical proximity of the web resources to the peers for a better and faster crawl. We use Distributed Hash Table (DHT) based protocols to perform the critical URL-duplicate and content-duplicate tests.作者: tolerance 時(shí)間: 2025-3-29 17:55
Decision-Theoretic Resource Selection for Different Data Types in MINDk (DTF), differs from existing algorithms like CORI in two ways: It computes a selection which minimises the overall costs (e.g. retrieval quality, time, money) of the distributed retrieval. And it allows for other data types beside text (e.g., names, years, images), whereas other resource selection techniques are restricted to text.作者: 冰雹 時(shí)間: 2025-3-29 22:19
The MIND Architecture for Heterogeneous Multimedia Federated Digital Librariese proxy (composed of several proxy components) for every connected library. These specialised, distributed components are connected via SOAP. This architecture with clearly defined responsibilities perfectly fits the needs of a distributed research project, and allows for integrating different platforms and programming languages.
