Conferences related to Data Structures

Back to Top

OCEANS 2016

The Marine Technology Scociety and the Oceanic Engineering Society of the IEEE cosponor a joint annual conference and exposition on ocean science, engineering, and policy. The OCEANS conference covers four days. One day for tutorials and three for approx. 500 technical papers and 150 -200 exhibits.

  • OCEANS 2015

    The Marine Technology Scociety and the Oceanic Engineering Society of the IEEE cosponor a joint annual conference and exposition on ocean science, engineering, and policy. The OCEANS conference covers four days. One day for tutorials and three for approx. 450 technical papers and 150-200 exhibits.

  • OCEANS 2014

    The OCEANS conference covers four days. One day for tutorials and three for approx. 450 technical papers and 150-200 exhibits.

  • OCEANS 2013

    Three days of 8-10 tracks of technical sessions (400-450 papers) and concurent exhibition (150-250 exhibitors)

  • OCEANS 2012

    Ocean related technology. Tutorials and three days of technical sessions and exhibits. 8-12 parallel technical tracks.

  • OCEANS 2011

    The Marine Technology Society and the Oceanic Engineering Scociety of the IEEE cosponsor a joint annual conference and exposition on ocean science engineering, and policy.

  • OCEANS 2010

    The Marine Technology Society and the Oceanic Engineering Scociety of the IEEE cosponsor a joint annual conference and exposition on ocean science engineering, and policy.

  • OCEANS 2009

  • OCEANS 2008

    The Marine Technology Society (MTS) and the Oceanic Engineering Society (OES) of the Institute of Electrical and Electronic Engineers (IEEE) cosponsor a joint conference and exposition on ocean science, engineering, education, and policy. Held annually in the fall, it has become a focal point for the ocean and marine community to meet, learn, and exhibit products and services. The conference includes technical sessions, workshops, student poster sessions, job fairs, tutorials and a large exhibit.


IGARSS 2015 - 2015 IEEE International Geoscience and Remote Sensing Symposium

The Geoscience and Remote Sensing Society (GRSS) seeks to advance science and technology in geoscience, remote sensing and related fields using conferences, education and other resources. Its fields of interest are the theory, concepts and techniques of science and engineering as they apply to the remote sensing of the earth, oceans, atmosphere, and space, as well as the processing, interpretation and dissemination of this information.


2013 21st International Conference on Geoinformatics

GIS in Regional Economic Development and Environmental Protection under Globalization


2013 IEEE 11th International Conference on Industrial Informatics (INDIN)

The aim of the conference is to bring together researchers and practitioners from industry and academia and provide them with a platform to report on recent developments, deployments, technology trends and research results, as well as initiatives related to industrial informatics and their application.


2013 IEEE International Conference on Data Engineering (ICDE 2013)

The annual IEEE International Conference on Data Engineering (ICDE) addresses research issues in designing, building, managing, and evaluating advanced data-intensive systems and applications. It is a leading forum for researchers, practitioners, developers, and users to explore cutting-edge ideas and to exchange techniques, tools, and experiences.

  • 2011 IEEE International Conference on Data Engineering (ICDE 2011)

    The ICDE is IEEE International Conference on Data Engineering is a premier forum for presentation of research results and advanced data-intensive applications and discussion of issues on data and knowledge engineering. The mission of the conference is to share research solutions to problems of today's information society and to identify new issues and directions for future research and development work. The ICDE 2011 will be organized by the L3S Research Center.

  • 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)

    Data Engineering deals with the use of engineering techniques and methodologies in the design, development and assessment of information systems for different computing platforms and application environments.


More Conferences

Periodicals related to Data Structures

Back to Top

Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...


Computer Graphics and Applications, IEEE

IEEE Computer Graphics and Applications (CG&A) bridges the theory and practice of computer graphics. From specific algorithms to full system implementations, CG&A offers a strong combination of peer-reviewed feature articles and refereed departments, including news and product announcements. Special Applications sidebars relate research stories to commercial development. Cover stories focus on creative applications of the technology by an artist or ...


Geoscience and Remote Sensing, IEEE Transactions on

Theory, concepts, and techniques of science and engineering as applied to sensing the earth, oceans, atmosphere, and space; and the processing, interpretation, and dissemination of this information.


Nuclear Science, IEEE Transactions on

All aspects of the theory and applications of nuclear science and engineering, including instrumentation for the detection and measurement of ionizing radiation; particle accelerators and their controls; nuclear medicine and its application; effects of radiation on materials, components, and systems; reactor instrumentation and controls; and measurement of radiation in space.


Potentials, IEEE

This award-winning magazine for technology professionals explores career strategies, the latest research and important technical developments. IEEE Potentials covers theories to practical applications and highlights technology's global impact.


More Periodicals

Most published Xplore authors for Data Structures

Back to Top

Xplore Articles related to Data Structures

Back to Top

Triangular mesh generation using knowledge base for three-dimensional boundary element method

H. Tsuboi; T. Shimotsukasa; K. Kato IEEE Transactions on Magnetics, 1990

The authors propose a method of triangular mesh generation using a knowledge base for three-dimensional boundary-element methods. To ensure a flexible and expandable mesh generator, the kernel of the mesh generator is coded in Lisp rather than in a procedural language and the knowledge base of the mesh generator is separated from the execution module. The procedure for the mesh ...


Fuzzy clusterization for logical function system minimization

R. A. Melnyk; A. A. Alexeyeyv Second IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2003. Proceedings, 2003

The minimization approach for the system of logical functions based on fuzzy reduction tree or fuzzy clusterization is considered. The algorithms to form the reduction tree for graphs and covers to obtain minimal logical sentences are proposed


Similarity search implementations for multi-core and many-core processors

Roberto Uribe-Paredes; Pedro Valero-Lara; Enrique Arias; José L. Sánchez; Diego Cazorla 2011 International Conference on High Performance Computing & Simulation, 2011

Similarity search in a large collection of stored objects in a metric database has become a most interesting problem. The Spaghettis is an efficient metric data structure to index metric spaces. However, for real applications, when processing large volumes of data, query response time can be high enough. In this case, it is necessary to apply mechanisms in order to ...


A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks

Luke Hunsberger; Roberto Posenato; Carlo Combi 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2015

A Conditional Simple Temporal Network (CSTN) is a data structure for representing and reasoning about time-points and temporal constraints, some of which may apply only in certain scenarios. The scenarios in a CSTN are represented by conjunctions of propositional literals whose truth values are not known in advance, but instead are observed in real time, during execution. The most important ...


Meta-textual models of relational knowledgebase

S. Rippa Second IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2003. Proceedings, 2003

The formalising of relations of the theory of relational databases encompasses in the main conventional entity set models and data structures. There is an analytical vehicle and formal definition of knowledge bases. The offered tool of meta-textual relational models of knowledge opens broad capabilities of development of the theory of relational knowledge bases. The basic fields of application: identification and ...


More Xplore Articles

Educational Resources on Data Structures

Back to Top

eLearning

Triangular mesh generation using knowledge base for three-dimensional boundary element method

H. Tsuboi; T. Shimotsukasa; K. Kato IEEE Transactions on Magnetics, 1990

The authors propose a method of triangular mesh generation using a knowledge base for three-dimensional boundary-element methods. To ensure a flexible and expandable mesh generator, the kernel of the mesh generator is coded in Lisp rather than in a procedural language and the knowledge base of the mesh generator is separated from the execution module. The procedure for the mesh ...


Fuzzy clusterization for logical function system minimization

R. A. Melnyk; A. A. Alexeyeyv Second IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2003. Proceedings, 2003

The minimization approach for the system of logical functions based on fuzzy reduction tree or fuzzy clusterization is considered. The algorithms to form the reduction tree for graphs and covers to obtain minimal logical sentences are proposed


Similarity search implementations for multi-core and many-core processors

Roberto Uribe-Paredes; Pedro Valero-Lara; Enrique Arias; José L. Sánchez; Diego Cazorla 2011 International Conference on High Performance Computing & Simulation, 2011

Similarity search in a large collection of stored objects in a metric database has become a most interesting problem. The Spaghettis is an efficient metric data structure to index metric spaces. However, for real applications, when processing large volumes of data, query response time can be high enough. In this case, it is necessary to apply mechanisms in order to ...


A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks

Luke Hunsberger; Roberto Posenato; Carlo Combi 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2015

A Conditional Simple Temporal Network (CSTN) is a data structure for representing and reasoning about time-points and temporal constraints, some of which may apply only in certain scenarios. The scenarios in a CSTN are represented by conjunctions of propositional literals whose truth values are not known in advance, but instead are observed in real time, during execution. The most important ...


Meta-textual models of relational knowledgebase

S. Rippa Second IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2003. Proceedings, 2003

The formalising of relations of the theory of relational databases encompasses in the main conventional entity set models and data structures. There is an analytical vehicle and formal definition of knowledge bases. The offered tool of meta-textual relational models of knowledge opens broad capabilities of development of the theory of relational knowledge bases. The basic fields of application: identification and ...


More eLearning Resources

IEEE-USA E-Books

  • Hybrid Systems

    This chapter contains sections titled: Hybrid Systems Approaches Components of Hybrid Systems Use of Complex Data Structures Design Methodologies Summary This chapter contains sections titled: Exercises References

  • Bibliography

    Our increasingly integrated world relies on networks both physical and virtual to transfer goods and information. The Internet is a network of networks that connects people around the world in a real-time manner, but it can be disrupted by massive data flows, diverse traffic patterns, inadequate infrastructure, and even natural disasters and political conflict. Similar challenges exist for transportation and energy distribution networks. There is an urgent need for intelligent and adaptable routing of network flows, and a rich literature has evolved that treats "oblivious network design." This book offers novel computational schemes for efficiently solving routing problems in unpredictable circumstances and proposes some real world applications for them. The versatile routing schemes mathematically guarantee long-term efficiency and are most appropriate for networks with non-deterministic (or oblivious) current and past states. After an introduction to network design and the importance of routing problems, the book presents mathematical tools needed to construct versatile routing schemes, emphasizing the role of linked hierarchical data structures, both top-down and bottom-up. It then describes two important applications of versatile routing schemes: a secure model for congestion-free content-centric networks (which will play a key role in the future of the Internet) and a novel approach for the distribution of green power resources on a smart electricity grid.

  • Cultural Computing

    In Phantasmal Media, D. Fox Harrell considers the expressive power of computational media. He argues, forcefully and persuasively, that the great expressive potential of computational media comes from the ability to construct and reveal phantasms -- blends of cultural ideas and sensory imagination. These ubiquitous and often-unseen phantasms -- cognitive phenomena that include sense of self, metaphors, social categories, narrative, and poetic thinking -- influence almost all our everyday experiences. Harrell offers an approach for understanding and designing computational systems that have the power to evoke these phantasms, paying special attention to the exposure of oppressive phantasms and the creation of empowering ones. He argues for the importance of cultural content, diverse worldviews, and social values in computing. The expressive power of phantasms is not purely aesthetic, he contends; phantasmal media can express and construct the types of meaning central to the human condition.Harrell discusses, among other topics, the phantasm as an orienting perspective for developers; expressive epistemologies, or data structures based on subjective human worldviews; morphic semiotics (building on the computer scientist Joseph Goguen's theory of algebraic semiotics); cultural phantasms that influence consensus and reveal other perspectives; computing systems based on cultural models; interaction and expression; and the ways that real-world information is mapped onto, and instantiated by, computational data structures.The concept of phantasmal media, Harrell argues, offers new possibilities for using the computer to understand and improve the human condition through the human capacity to imagine.

  • Dependent Data Structures

    This chapter contains sections titled: 9.1 More Length-Indexed Lists, 9.2 Heterogeneous Lists, 9.3 Recursive Type Definitions, 9.4 Data Structures as Index Functions, 9.5 Choosing between Representations

  • Compiler Support for Out-of-Core Arrays on Parallel Machines

    This chapter contains sections titled: Annotations for Specifying Out-of-Core Data Structures, The I/O System, Compiling for Out-of-Core Execution, Experience with a Prototype Compiler, Performance of the Prototype, Related Work, Conclusions, Acknowledgments

  • Index

    Our increasingly integrated world relies on networks both physical and virtual to transfer goods and information. The Internet is a network of networks that connects people around the world in a real-time manner, but it can be disrupted by massive data flows, diverse traffic patterns, inadequate infrastructure, and even natural disasters and political conflict. Similar challenges exist for transportation and energy distribution networks. There is an urgent need for intelligent and adaptable routing of network flows, and a rich literature has evolved that treats "oblivious network design." This book offers novel computational schemes for efficiently solving routing problems in unpredictable circumstances and proposes some real world applications for them. The versatile routing schemes mathematically guarantee long-term efficiency and are most appropriate for networks with non-deterministic (or oblivious) current and past states. After an introduction to network design and the importance of routing problems, the book presents mathematical tools needed to construct versatile routing schemes, emphasizing the role of linked hierarchical data structures, both top-down and bottom-up. It then describes two important applications of versatile routing schemes: a secure model for congestion-free content-centric networks (which will play a key role in the future of the Internet) and a novel approach for the distribution of green power resources on a smart electricity grid.

  • Applications

    Our increasingly integrated world relies on networks both physical and virtual to transfer goods and information. The Internet is a network of networks that connects people around the world in a real-time manner, but it can be disrupted by massive data flows, diverse traffic patterns, inadequate infrastructure, and even natural disasters and political conflict. Similar challenges exist for transportation and energy distribution networks. There is an urgent need for intelligent and adaptable routing of network flows, and a rich literature has evolved that treats "oblivious network design." This book offers novel computational schemes for efficiently solving routing problems in unpredictable circumstances and proposes some real world applications for them. The versatile routing schemes mathematically guarantee long-term efficiency and are most appropriate for networks with non-deterministic (or oblivious) current and past states. After an introduction to network design and the importance of routing problems, the book presents mathematical tools needed to construct versatile routing schemes, emphasizing the role of linked hierarchical data structures, both top-down and bottom-up. It then describes two important applications of versatile routing schemes: a secure model for congestion-free content-centric networks (which will play a key role in the future of the Internet) and a novel approach for the distribution of green power resources on a smart electricity grid.

  • No title

    In recent years, several knowledge bases have been built to enable large-scale knowledge sharing, but also an entity-centric Web search, mixing both structured data and text querying. These knowledge bases offer machine- readable descriptions of real-world entities, e.g., persons, places, published on the Web as Linked Data. However, due to the different information extraction tools and curation policies employed by knowledge bases, multiple, complementary and sometimes conflicting descriptions of the same real-world entities may be provided. Entity resolution aims to identify different descriptions that refer to the same entity appearing either within or across knowledge bases. The objective of this book is to present the new entity resolution challenges stemming from the openness of the Web of data in describing entities by an unbounded number of knowledge bases, the semantic and structural diversity of the descriptions provided across domains even for the same real-world entities, a well as the autonomy of knowledge bases in terms of adopted processes for creating and curating entity descriptions. The scale, diversity, and graph structuring of entity descriptions in the Web of data essentially challenge how two descriptions can be effectively compared for similarity, but also how resolution algorithms can efficiently avoid examining pairwise all descriptions. The book covers a wide spectrum of entity resolution issues at the Web scale, including basic concepts and data structures, main resolution tasks and workflows, as well as state-of-the-art algorithmic techniques and experimental trade-offs.

  • Epilogue

    In this book Kaj Grÿnbÿk and Randall H. Trigg present a set of principles for the design of open hypermedia systems and provide concrete implications of these principles for issues ranging from data structures to architectures and system integration, and for settings as diverse as the World Wide Web and the workplace.The principles, which cover both hypermedia system processing and data structures, reflect results from decades of hypermedia research, including the popular Dexter hypertext reference model and the authors own extended object-oriented version of the Dexter model. One important principle is the notion of links as first-class objects outside the data. Emerging systems such as HyperWave, Microcosm, and Devise Hypermedia apply this principle to extend the capabilities of the Web. The authors also discuss the management of incomplete and dangling links, time-based media including video and sound, support for collaboration and shared hypermedia structures, worldwide distribution, and integration of third-party applications in open hypermedia systems.

  • Data Organization and Databases

    This chapter contains sections titled: 12.1 Introduction, 12.2 Memory Hierarchy, 12.3 Index Structures, 12.4 Multidimensional Indexing, 12.5 Relational Databases, 12.6 Manipulating Tables, 12.7 The Structured Query Language (SQL), 12.8 Query Execution and Optimization, 12.9 Data Warehousing and Online Analytical Processing (OLAP), 12.10 Data Structures for OLAP, 12.11 String Databases, 12.12 Massive Data Sets, Data Management, and Data Mining, 12.13 Further Reading



Standards related to Data Structures

Back to Top

No standards are currently tagged "Data Structures"


Jobs related to Data Structures

Back to Top