Borovica-Gajic / Khan / Zheng | Databases Theory and Applications | Buch | 978-981-956195-7 | www2.sack.de

Buch, Englisch, Band 16391, 422 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 663 g

Reihe: Lecture Notes in Computer Science

Borovica-Gajic / Khan / Zheng

Databases Theory and Applications

36th Australasian Database Conference, ADC 2025, Sydney, NSW, Australia and Bali, Indonesia, December 4-6, 2025, Proceedings
Erscheinungsjahr 2026
ISBN: 978-981-956195-7
Verlag: Springer

36th Australasian Database Conference, ADC 2025, Sydney, NSW, Australia and Bali, Indonesia, December 4-6, 2025, Proceedings

Buch, Englisch, Band 16391, 422 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 663 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-981-956195-7
Verlag: Springer


This book constitutes the refereed proceedings of the 36th Australasian Database Conference on Databases Theory and Applications, ADC 2025, held in Sydney, NSW, Australia, during December 4–7, 2025.

The 29 full papers presented in this volume are carefully reviewed and selected from 63 submissions. The papers of CDFC 2025 organized in topical sections as follows: Intelligent Investment and Quantitative Trading; Financial Risk Management.

Borovica-Gajic / Khan / Zheng Databases Theory and Applications jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


.- Research Track Papers.

.- Parameter-Efficient Wheat Disease Segmentation.

.- Computing Historical k-core in Parallel.

.- Augment to Segment: Tackling Pixel-Level Imbalance in Wheat Disease and Pest Segmentation.

.- An Experimental Study of Graph Pattern Mining Systems.

.- Distributional Offline Reinforcement Learning for Recommender Systems.

.- Importance Sampling Facilitates Ensemble Adversarial Transferability.

.- Pursuit of Truth: Incentive Mechanism Involving Privacy Demands in Mobile Crowdsourcing.

.- Multilingual Text-to-SQL: Benchmarking the Limits of Language Models with Collaborative Language Agents.

.- An Extensible Benchmark for Value Ambiguity Resolution in Text-to-SQL.

.- A Simple and Effective Index for Querying Large Quasi-Cliques.

.- Dynamic Orchestration of Multi-Agent System for Real-World Multi-Image Agricultural VQA.

.- XEvalAD: An Explainable Evaluation Framework for Anomaly Detection via Item Response Theory.

.- From Exploratory Heuristics to Exact Search: Accelerating Maximum Common Subgraph Algorithms.

.- PPPR: Accelerating Probabilistic Reverse Top-k Queries via Clustering and Cluster-Aware Threshold Estimation.

.- ReaCH-TGN: Contrastive Hop- and Time-Aware Temporal Graph Network for Reachability Prediction.

.- Privacy-Preserving Graph Data Deduplication for Deep Graph Learning.

.- S2Q: Teaching Language Models New Facts Through Knowledge Graph Instruction Synthesis.

.- The Parameterization Gap: Backtracking Multimodal NL2PSQL.

.- Balanced Popularity in Multi-Product Billboard Advertisement.

.- Federated Learning for Computing Power Network: A Latency Optimization Scheduling Framework based on Deep Reinforcement Learning.

.- Continual Multimodal Knowledge Graph Learning via Adaptive Replay and Topology Distillation.

.- ReaKase-8B: Legal Case Retrieval via Knowledge and Reasoning Representations with LLMs.

.- Shepherding Track Papers.

.- Online Adaptive Rumor Blocking with Pertinence Set.

.- LLM-Enhanced Processing of Complex Spatial Queries.

.- Advancing Spatial Keyword Queries: From Filters to Unified Vector Embeddings.

.- SQL-to-Text Generation with Weighted-AST Few-Shot Prompting.

.- FusionSHAP: Window Level Shapley Explanations with Semantic and Physical Fusion for STGNNs.

.- LHATM: LLM-Guided Hierarchy-Aware Topic Modeling Framework.

.- Efficient Algorithms for Multi-Criteria Clique Discovery in Multilayer Graphs.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.