標(biāo)題: Titlebook: Visual and Multimedia Information Management; IFIP TC2/WG2.6 Sixth Xiaofang Zhou,Pearl Pu Book 2002 IFIP International Federation for Infor [打印本頁(yè)] 作者: finesse 時(shí)間: 2025-3-21 16:33
書(shū)目名稱(chēng)Visual and Multimedia Information Management影響因子(影響力)
書(shū)目名稱(chēng)Visual and Multimedia Information Management影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Visual and Multimedia Information Management網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Visual and Multimedia Information Management網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Visual and Multimedia Information Management被引頻次
書(shū)目名稱(chēng)Visual and Multimedia Information Management被引頻次學(xué)科排名
書(shū)目名稱(chēng)Visual and Multimedia Information Management年度引用
書(shū)目名稱(chēng)Visual and Multimedia Information Management年度引用學(xué)科排名
書(shū)目名稱(chēng)Visual and Multimedia Information Management讀者反饋
書(shū)目名稱(chēng)Visual and Multimedia Information Management讀者反饋學(xué)科排名
作者: 表示問(wèn) 時(shí)間: 2025-3-21 23:38 作者: 無(wú)底 時(shí)間: 2025-3-22 02:55 作者: floodgate 時(shí)間: 2025-3-22 07:01
Lekha Chaisorn,Tat-Seng ChuaBefore we move on to the topics of resultants and an algorithmic treatment of real algebra, we shall take a short pause to study in this chapter the unique factorization domain, the principal ideal domain, and the Euclidean domain. Of course, readers familiar with these topics may safely skip this chapter and go directly to the next chapter.作者: Arthritis 時(shí)間: 2025-3-22 12:32 作者: lobster 時(shí)間: 2025-3-22 15:56
Zaher Aghbari,Kun-Seok Oh,Yaokai Feng,Akifumi Makinouchi, mit welchen Merkmalen die Aufgaben und Vorgaben der Fertigungssteuerung beschrieben werden k?nnen. Aus der Definition der Fertigungssteuerung ergeben sich aufgaben- oder sachbezogene Beschreibungsmerkmale für die Sachstruktur, zeitliche Beschreibungsmerkmale für die Zeitstruktur und aufbaubezogene Beschreibungsmerkmale für die Aufbaustruktur.作者: languor 時(shí)間: 2025-3-22 17:59
Yunyun Cao,Yoshitomo Yaginuma,Masao Sakauchiswahl stehen, spricht man von einem nicht-deterministischen Algorithmus. Dieser Begriff und seine formale Definition werden kurz besprochen. Anschlie?end werden zwei spezielle nicht-deterministische Algorithmen, n?mlich Grammatiken und axiomatische Systeme, eingeführt.作者: 吹牛大王 時(shí)間: 2025-3-22 23:53 作者: 傻瓜 時(shí)間: 2025-3-23 02:01
978-1-4757-6935-7IFIP International Federation for Information Processing 2002作者: 換話(huà)題 時(shí)間: 2025-3-23 09:02
Visual and Multimedia Information Management978-0-387-35592-4Series ISSN 1868-4238 Series E-ISSN 1868-422X 作者: daredevil 時(shí)間: 2025-3-23 13:21
isten Anwendungen spielt seine F?higkeit, grosse Mengen von Informationen zu speichern und wieder zug?nglich zu machen, die wichtigste Rolle (und wird als Haupteigenschaft betrachtet): seine F?higkeit zu rechnen, d.h. zu kalkulieren, Arithmetik auszuführen, ist in vielen F?llen nahezu belanglos. In 作者: Ascendancy 時(shí)間: 2025-3-23 17:21 作者: 遍及 時(shí)間: 2025-3-23 21:17
David J. Abelre [96, 97] über den Stand und die Verbreitung EDV-unterstützter Planungsverfahren. Er kommt zu dem Ergebnis, da? solche Verfahren bzw. Programme nur in den wenigsten F?llen eingesetzt werden. Darüber hinaus werden sie bei zwei Dritteln aller Anwendungen als nur am Rande nützlich angesehen.作者: CHURL 時(shí)間: 2025-3-23 23:35 作者: 檔案 時(shí)間: 2025-3-24 04:47 作者: 使迷惑 時(shí)間: 2025-3-24 10:11
Zaher Aghbari,Kun-Seok Oh,Yaokai Feng,Akifumi Makinouchi, mit welchen Merkmalen die Aufgaben und Vorgaben der Fertigungssteuerung beschrieben werden k?nnen. Aus der Definition der Fertigungssteuerung ergeben sich aufgaben- oder sachbezogene Beschreibungsmerkmale für die Sachstruktur, zeitliche Beschreibungsmerkmale für die Zeitstruktur und aufbaubezogene作者: misshapen 時(shí)間: 2025-3-24 10:42
Yunyun Cao,Yoshitomo Yaginuma,Masao Sakauchiswahl stehen, spricht man von einem nicht-deterministischen Algorithmus. Dieser Begriff und seine formale Definition werden kurz besprochen. Anschlie?end werden zwei spezielle nicht-deterministische Algorithmen, n?mlich Grammatiken und axiomatische Systeme, eingeführt.作者: 刺耳 時(shí)間: 2025-3-24 14:59
Sharma Chakravarthy,Seokwon Yangthe capacity of isolated intersection, we propose a multi-strategy fuzzy control algorithm to adapt to the variation of urban traffic flow, and then optimize its control rules and membership functions by using improved genetic algorithm. The simulation result shows that compared with traditional gen作者: 乏味 時(shí)間: 2025-3-24 22:37 作者: monochromatic 時(shí)間: 2025-3-25 02:16 作者: 柔美流暢 時(shí)間: 2025-3-25 06:30 作者: AMPLE 時(shí)間: 2025-3-25 09:05
Ryong Lee,Hiroki Takakura,Yahiko Kambayashiing and the service quality of network coverage. To guarantee the continuous coverage of the rechargeable sensors, continuous power supply for sensors becomes more important. In this paper, we focus on the Charging Scheduling problem with Maximized Energy Efficiency in WRSNs (CS-MEE Problem), in whi作者: FID 時(shí)間: 2025-3-25 12:07 作者: vocation 時(shí)間: 2025-3-25 17:52
Yixin Ruan,Jason Chionh,Zhiyong Huang,Lidan Shou,Kian-Lee Tanf this game. Exchange rates from dollar to yen vary over time. An optimal offline algorithm trades all dollars using the highest trading rate. In the online setting, any traded yen cannot be converted back to dollars before this game terminates. Under the assumption of knowing the lower bound and th作者: 障礙 時(shí)間: 2025-3-25 20:34 作者: 鳴叫 時(shí)間: 2025-3-26 03:25
Valéria Gon?alves Soares,Ana Carolina Salgadoate ads to slots. However, when other practical conditions must be fulfilled –such as budget constraints, exploration of the performance of new ads, etc.– optimal allocations are hard to obtain. We provide a method to optimally allocate ads to slots under the practical conditions mentioned above. Ou作者: 不持續(xù)就爆 時(shí)間: 2025-3-26 06:20 作者: 肥料 時(shí)間: 2025-3-26 08:41 作者: 釘牢 時(shí)間: 2025-3-26 13:48
Federated Information Systems for Communities for the community of interest. Technically, this form of Federated Information System poses the usual problems of size (the number of services present) and heterogeneity in the services. Although recent advances in the area give some confidence that large-scale, highly-heterogeneous networks of Web作者: hypertension 時(shí)間: 2025-3-26 18:36 作者: 改變 時(shí)間: 2025-3-26 22:42
Balancing Fidelity and Performance in Virtual Walkthrough order to minimize 110 cost, we propose an optimized search technique. We have implemented the ViSA structure in a prototype walkthrough system and our experiments show that it can provide quality visual fidelity with an acceptable constant real time frame rate.作者: 背書(shū) 時(shí)間: 2025-3-27 01:20
Book 2002e; ..Annotation and retrieval of image databases;..Visual querying in geographical information systems; ..Videodatabases; and ..Virtual environment and modeling of complexshapes... .Visual and Multimedia Information Management.comprises the proceedings of the sixth International Conference onVisual 作者: anticipate 時(shí)間: 2025-3-27 05:22 作者: muscle-fibers 時(shí)間: 2025-3-27 09:31
en eine Abstraktion der Wirklichkeit dar, weil die für dieses bestimmte Problem nebens?chlichen und belanglosen Eigenschaften und Besonderheiten der realen Objekte unberücksichtigt bleiben. Eine Abstraktion ist somit auch eine Vereirifachung der Tatsachen. Als Beispiel k?nnen wir die Personalkartei eines Arbe978-3-519-02260-2978-3-322-96663-6作者: 極為憤怒 時(shí)間: 2025-3-27 16:25
Hongjiang Zhang,Zhong Suische Logik und die Algorithmentheorie angefangen haben, in die Lehrpl?ne unserer Universit?ten und p?dagogischen Hochschulen als für das Studium der Mathematikstudenten aller Fachrichtungen obligatorische Disziplin einzudringen. Das vorliegende Buch ist aus der Bearbeitung von Nachschriften von Vor作者: 公共汽車(chē) 時(shí)間: 2025-3-27 19:48
Yixin Ruan,Jason Chionh,Zhiyong Huang,Lidan Shou,Kian-Lee Tandel. We further study a setting in which the number of trades cannot exceed a given number .. We provide a few optimal algorithms, analyze their running time, and show output-sensitive time bounds under this restriction for the two-way currency trading problem.作者: 駁船 時(shí)間: 2025-3-27 22:29
Yuqing Song,Wei Wang,Aidong Zhanghow to exert the control) or we prove that Copeland. is computationally resistant to control in that scenario (i.e., we prove that control problem to be NP-hard). In particular, we prove that Copeland., the system commonly referred to as “Copeland voting,” provides full resistance to constructive co作者: 飛行員 時(shí)間: 2025-3-28 04:01 作者: Grandstand 時(shí)間: 2025-3-28 09:22 作者: 閑聊 時(shí)間: 2025-3-28 14:29
Ryong Lee,Hiroki Takakura,Yahiko Kambayashi an heterogeneous-weighted-graph algorithm, called CS-HWG, to solve the problem. To evaluate the performance of the proposed algorithm, the extensive simulation experiments are conducted under four influencing factors in terms of the energy efficiency of the mobile charger to verify the effectiveness of the algorithm.作者: Rejuvenate 時(shí)間: 2025-3-28 15:24
High-Dimensional Image Indexing Based on Adaptive Partitioning and Vector Approximation data-set. The . is to adaptively partition the data space to find subspaces with high-density clusters and to assign more bits to them to increase the discriminatory power of the vector approximation. An empirical evaluation shows that the LPC.-file results in significant performance improvements for real image datasets strongly clustered.作者: intention 時(shí)間: 2025-3-28 19:57
Indexing Images in High-Dimensional and Dynamic-Weighted Feature Spacesweighted differently, we show that our approach remains very effective. Our empirical study on both a 51K and a one-million-image dataset shows that tackling indexing as a classification problem and solving the problem with TSVQ is efficient, effective, and scalable with respect to both data dimensions and dataset size.作者: Forehead-Lift 時(shí)間: 2025-3-29 02:38 作者: FATAL 時(shí)間: 2025-3-29 04:18
Hans-J. Schek,Heiko Schuldt,Roger Weberrkeit ihrer Strukturen w?hrend der Ausführung. Solche ver?nderbaren Strukturen heissen .. Natürlich sind die Komponenten dieser Strukturen auf irgendeiner tieferen Stufe statisch, d.h. von einem Grundtyp. Dieses Kapitel ist der Konstruktion, Analyse und Verwaltung dynamischer Datenstrukturen gewidmet.作者: Occlusion 時(shí)間: 2025-3-29 08:51
The Segmentation and Classification of Story Boundaries in News Videos of news video obtained from the MediaCorp of Singapore. Our initial results indicate that we could achieve a high accuracy of over 95 % for shot classification. The use of HMM analysis helps to improve the accuracy of the shot classification and achieve over 89% accuracy on story segmentation.作者: lethargy 時(shí)間: 2025-3-29 14:11 作者: 合法 時(shí)間: 2025-3-29 18:53
Automatic Annotation and Retrieval of Imagese semantic features are automatically annotated to the images. Based on the semantic features extracted from images, high-level (semantics-based) querying and browsing of images can be achieved. The experimental results demonstrate the effectiveness of our approach.作者: Mirage 時(shí)間: 2025-3-29 21:44
Lory Molesky,Jayant Sharmatretenden Bildinhalte, also der Blutgef??e, Herzinnenr?ume und Herzmuskel. Da das Abbild des Herzens und seiner Blutgef??e durch Subtraktion zweier Teilaufnahmen entsteht, analysiert er Aufnahmefehler und zeigt erprobte L?sungen für die Bildvorverarbeitung und -auswertung bei der Gef??erkennung.978-3-8348-1035-9978-3-8348-9647-6作者: 盲信者 時(shí)間: 2025-3-30 01:00 作者: angiography 時(shí)間: 2025-3-30 04:06 作者: 腐敗 時(shí)間: 2025-3-30 09:35 作者: 貿(mào)易 時(shí)間: 2025-3-30 13:06
Som-Based K-Nearest Neighbors Search in Large Image Databasess, the . requires a storage space that is linear in the number of generated clusters. Due to the simplicity and compactness of the .,the experiments show that our method outperforms other well know methods.作者: guzzle 時(shí)間: 2025-3-30 19:59 作者: endoscopy 時(shí)間: 2025-3-30 22:07 作者: 擴(kuò)音器 時(shí)間: 2025-3-31 03:06 作者: 豐滿(mǎn)有漂亮 時(shí)間: 2025-3-31 07:52
An Overview of Oracle Chart Builder and Mapviewerat hide the complexity of spatial data queries and cartographic rendering, while providing customizable options for more advanced users. This paper presents an overview of data visualization features in the . Application Server product from Oracle.作者: Locale 時(shí)間: 2025-3-31 10:59 作者: hermitage 時(shí)間: 2025-3-31 13:41
An Entropy-Based Approach to Visualizing Database Structurehe type of structure we are interested in discovering is related to functional dependencies. Our approach is not dependent on the underlying domain of the data, providing a view of the dependency landscape within a relation. Using these techniques, we describe comparative results for a wide variety of synthetic and real data.作者: GLIDE 時(shí)間: 2025-3-31 18:51
1868-4238 data. Visual interfaces that allow users tointeract with large databases must scale to web and distributedapplications. Interaction with databases must employ multiple and morediversified interaction modalities, such as speech and gesture, inaddition to visual exploitation. Finally, the basic elemen作者: angiography 時(shí)間: 2025-3-31 22:46
Dennis P. Groth,Edward L. Robertsons, our algorithm handles a single arc weight increase in . expected time, where . is the number of nodes and . is the number of edges in the digraph. Specifically, our algorithm is an .(.) expected time algorithm when .?=?Ω(.log.). This solves partially an open problem proposed by Demetrescu and Italiano (Journal of the ACM. 51(2004), 968–992).作者: irritation 時(shí)間: 2025-4-1 05:49 作者: 生存環(huán)境 時(shí)間: 2025-4-1 09:23 作者: 乞討 時(shí)間: 2025-4-1 10:56
Hyperdatabasesll users have a pre-defined view on a global information space and have to access data by the same primitive means. However, a more convenient solution from a user’s point of view considers her/his individual context and interests by mapping the global information space to a personal one. Yet, the o作者: macabre 時(shí)間: 2025-4-1 17:19 作者: panorama 時(shí)間: 2025-4-1 19:59
Relevance Feedback in CBIRperformance. This effort tries to bridge the gap between low-level image features and high-level semantic contents of images as this gap is the bottleneck of CBIR. We consider relevance feedback in CBIR a small sample-learning process in sparse image feature space. Almost all of the previously propo作者: AGATE 時(shí)間: 2025-4-2 01:44 作者: Climate 時(shí)間: 2025-4-2 06:19
Som-Based K-Nearest Neighbors Search in Large Image Databases using a self-organizing map algorithm. Then, we map each cluster into a point in one-dimensional distance space. From these mapped points, we construct a simple, compact and yet fast index structure, called .. Unlike most indexes of KNN algorithms that require storage space exponential in dimension作者: keloid 時(shí)間: 2025-4-2 09:55
