LATIN 2004: Theoretical Informatics

LATIN 2004: Theoretical Informatics

Author: Martin Farach-Colton

Publisher: Springer Science & Business Media

Published: 2004-03-19

Total Pages: 642

ISBN-13: 3540212582

DOWNLOAD EBOOK

This volume contains the proceedings of the Latin American Theoretical Inf- matics (LATIN) conference that was held in Buenos Aires, Argentina, April 5–8, 2004. The LATIN series of symposia was launched in 1992 to foster interactions between the Latin American community and computer scientists around the world. This was the sixth event in the series, following S ̃ ao Paulo, Brazil (1992), Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay (2000), and Cancun, Mexico (2002). The proceedings of these conferences were also published by Springer-Verlag in the Lecture Notes in Computer Science series: Volumes 583, 911, 1380, 1776, and 2286, respectively. Also, as before, we published a selection of the papers in a special issue of a prestigious journal. We received 178 submissions. Each paper was assigned to four program c- mittee members, and 59 papers were selected. This was 80% more than the previous record for the number of submissions. We feel lucky to have been able to build on the solid foundation provided by the increasingly successful previous LATINs. And we are very grateful for the tireless work of Pablo Mart ́ ?nez L ́ opez, the Local Arrangements Chair. Finally, we thank Springer-Verlag for publishing these proceedings in its LNCS series.


LATIN 2006: Theoretical Informatics

LATIN 2006: Theoretical Informatics

Author: José R. Correa

Publisher: Springer Science & Business Media

Published: 2006-03-06

Total Pages: 828

ISBN-13: 354032755X

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.


LATIN 2014: Theoretical Informatics

LATIN 2014: Theoretical Informatics

Author: Alberto Pardo

Publisher: Springer

Published: 2014-03-24

Total Pages: 793

ISBN-13: 3642544231

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 11th Latin American Symposium on Theoretical Informatics, LATIN 2014, held in Montevideo, Uruguay, in March/April 2014. The 65 papers presented together with 5 abstracts were carefully reviewed and selected from 192 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on complexity, computational geometry, graph drawing, automata, computability, algorithms on graphs, algorithms, random structures, complexity on graphs, analytic combinatorics, analytic and enumerative combinatorics, approximation algorithms, analysis of algorithms, computational algebra, applications to bioinformatics, budget problems and algorithms and data structures.


LATIN 2008: Theoretical Informatics

LATIN 2008: Theoretical Informatics

Author: Eduardo Sany Laber

Publisher: Springer

Published: 2008-04-04

Total Pages: 809

ISBN-13: 3540787739

DOWNLOAD EBOOK

This proceedings volume examines a range of topics in theoretical computer science, including automata theory, data compression, logic, machine learning, mathematical programming, parallel and distributed computing, quantum computing and random structures.


LATIN 2022: Theoretical Informatics

LATIN 2022: Theoretical Informatics

Author: Armando Castañeda

Publisher: Springer Nature

Published: 2022-10-28

Total Pages: 782

ISBN-13: 303120624X

DOWNLOAD EBOOK

This book constitutes the proceedings of the 15th Latin American Symposium on Theoretical Informatics, LATIN 2022, which took place in Guanajuato, Mexico, in November 2022. The 46 papers presented in this volume were carefully reviewed and selected from 114 submissions. They were organized in topical sections as follows: Algorithms and Data Structures; Approximation Algorithms; Cryptography; Social Choice Theory; Theoretical Machine Learning; Automata Theory and Formal Languages; Combinatorics and Graph Theory; Complexity Theory; Computational Geometry. Chapter “Klee’s Measure Problem Made Oblivious” is available open access under a CC BY 4.0 license.


LATIN 2012: Theoretical Informatics

LATIN 2012: Theoretical Informatics

Author: David Fernández-Baca

Publisher: Springer

Published: 2012-04-10

Total Pages: 685

ISBN-13: 3642293441

DOWNLOAD EBOOK

This book constitutes the proceedings of the 10th Latin American Symposium on Theoretical Informatics, LATIN 2012, held in Arequipa, Peru, in April 2012. The 55 papers presented in this volume were carefully reviewed and selected from 153 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.


LATIN 2010: Theoretical Informatics

LATIN 2010: Theoretical Informatics

Author: Alejandro López-Ortiz

Publisher: Springer

Published: 2010-04-22

Total Pages: 726

ISBN-13: 3642122000

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 9th International Latin American Symposium on Theoretical Informatics, LATIN 2010, held in Oaxaca, Mexico; in April 2010. The 56 revised full papers presented together with the abstracts of 4 invited plenary talks were carefully reviewed and selected from 155 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.


Bioinformatics Algorithms

Bioinformatics Algorithms

Author: Ion Mandoiu

Publisher: John Wiley & Sons

Published: 2008-02-25

Total Pages: 528

ISBN-13: 0470097736

DOWNLOAD EBOOK

Presents algorithmic techniques for solving problems in bioinformatics, including applications that shed new light on molecular biology This book introduces algorithmic techniques in bioinformatics, emphasizing their application to solving novel problems in post-genomic molecular biology. Beginning with a thought-provoking discussion on the role of algorithms in twenty-first-century bioinformatics education, Bioinformatics Algorithms covers: General algorithmic techniques, including dynamic programming, graph-theoretical methods, hidden Markov models, the fast Fourier transform, seeding, and approximation algorithms Algorithms and tools for genome and sequence analysis, including formal and approximate models for gene clusters, advanced algorithms for non-overlapping local alignments and genome tilings, multiplex PCR primer set selection, and sequence/network motif finding Microarray design and analysis, including algorithms for microarray physical design, missing value imputation, and meta-analysis of gene expression data Algorithmic issues arising in the analysis of genetic variation across human population, including computational inference of haplotypes from genotype data and disease association search in case/control epidemiologic studies Algorithmic approaches in structural and systems biology, including topological and structural classification in biochemistry, and prediction of protein-protein and domain-domain interactions Each chapter begins with a self-contained introduction to a computational problem; continues with a brief review of the existing literature on the subject and an in-depth description of recent algorithmic and methodological developments; and concludes with a brief experimental study and a discussion of open research challenges. This clear and approachable presentation makes the book appropriate for researchers, practitioners, and graduate students alike.


Integrating Psychoinformatics with Ubiquitous Social Networking

Integrating Psychoinformatics with Ubiquitous Social Networking

Author: Felix Beierle

Publisher: Springer Nature

Published: 2021-04-23

Total Pages: 210

ISBN-13: 3030688402

DOWNLOAD EBOOK

This book deepens the understanding of people through smartphone data obtained via mobile sensing and applies psychological insights for social networking applications. The author first introduces TYDR, an application for researching smartphone data and user personality. A novel, structured privacy model for mobile sensing applications is developed and the obtained empirical results help researchers gauge what data they can expect users to share in daily-life studies. The new research findings, the concept of mobile sensing, and psychological insights about the formation and structure of real-life social networks are integrated into the field of social networking. Finally, for this novel integration, the author presents concepts, decentralized software architectures, and fully realized prototypes that recommend new contacts, media, and locations to individual users and groups of users.