Maher | Advances in Computer Science - ASIAN 2004, Higher Level Decision Making | E-Book | sack.de
E-Book

E-Book, Englisch, Band 3321, 510 Seiten, eBook

Reihe: Lecture Notes in Computer Science

Maher Advances in Computer Science - ASIAN 2004, Higher Level Decision Making

9th Asian Computing Science Conference. Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, Chiang Mai, Thailand, December 8-10, 2004
Erscheinungsjahr 2004
ISBN: 978-3-540-30502-6
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

9th Asian Computing Science Conference. Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, Chiang Mai, Thailand, December 8-10, 2004

E-Book, Englisch, Band 3321, 510 Seiten, eBook

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-30502-6
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark



Maher Advances in Computer Science - ASIAN 2004, Higher Level Decision Making jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


Keynote Papers.- Counting by Coin Tossings.- On the Role Definitions in and Beyond Cryptography.- Meme Media for the Knowledge Federation Over the Web and Pervasive Computing Environments.- Contributed Papers.- Probabilistic Space Partitioning in Constraint Logic Programming.- Chi-Square Matrix: An Approach for Building-Block Identification.- Design Exploration Framework Under Impreciseness Based on Register-Constrained Inclusion Scheduling.- Hiord: A Type-Free Higher-Order Logic Programming Language with Predicate Abstraction.- Assessment Aggregation in the Evidential Reasoning Approach to MADM Under Uncertainty: Orthogonal Versus Weighted Sum.- Learnability of Simply-Moded Logic Programs from Entailment.- A Temporalised Belief Logic for Specifying the Dynamics of Trust for Multi-agent Systems.- Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing.- Identity-Based Authenticated Broadcast Encryption and Distributed Authenticated Encryption.- Deniable Partial Proxy Signatures.- Formal Concept Mining: A Statistic-Based Approach for Pertinent Concept Lattice Construction.- A Robust Approach to Content-Based Musical Genre Classification and Retrieval Using Multi-feature Clustering.- Registration of 3D Range Images Using Particle Swarm Optimization.- Zero-Clairvoyant Scheduling with Inter-period Constraints.- A Novel Texture Synthesis Based Algorithm for Object Removal in Photographs.- Highly Efficient and Effective Techniques for Thai Syllable Speech Recognition.- Robot Visual Servoing Based on Total Jacobian.- Invited Papers.- Online Stochastic and Robust Optimization.- Optimal Constraint Decomposition for Distributed Databases.- Adaptive Random Testing.- Minimal Unsatisfiable Sets: Classification and Bounds.- LPOD Answer Sets and Nash Equilibria.- GraphTheoretic Models for Reasoning About Time.- Rule-Based Programming and Proving: The ELAN Experience Outcomes.- Towards Flexible Graphical Communication Using Adaptive Diagrams.- A Framework for Compiler Driven Design Space Exploration for Embedded System Customization.- Spectral-Based Document Retrieval.- Metadata Inference for Document Retrieval in a Distributed Repository.- A Simple Theory of Expressions, Judgments and Derivations.- Reactive Framework for Resource Aware Distributed Computing.- The Feature Selection and Intrusion Detection Problems.- On the BDD of a Random Boolean Function.- Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models (Summary).



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.