Concept

Node (computer science)

Related lectures (32)

Explains the reference implementation for a concurrent stack and the importance of handling concurrency issues.

Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.

Huffman's Algorithm: Mechanizing the Proof

Explores the mechanization of Huffman's algorithm proof and functional implementation.

Tree-Structured Indexing: B+ Trees Explained

Covers B+ Trees, a key data structure for efficient indexing in databases.

JavaFX: Intermediate Scene Graph

Covers intermediate JavaFX concepts, focusing on scene graph and appearance.

Industry 4.0, Energy Efficient Datacenters MOOC: IoT Systems and Industrial Applications with Design Thinking

Explores fine-grained management in energy-efficient datacenters with a focus on real-time energy use classification.

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

General Introduction to Big Data

Covers data science tools, Hadoop, Spark, data lake ecosystems, CAP theorem, batch vs. stream processing, HDFS, Hive, Parquet, ORC, and MapReduce architecture.

Neuro-symbolic Representations: Commonsense Knowledge & Reasoning

Delves into neuro-symbolic representations for commonsense knowledge and reasoning in natural language processing applications.

Fault Tolerance and Recovery: Data Safety in Distributed Computing

Explores fault tolerance, data safety, and job recovery in distributed computing systems.

IC Colloquium: Talk by Peter Buneman

Fold Reduce Operations

Explores fold (reduce) operations in parallel programming using Scala, covering associative operations, expression trees, parallel reduction, and array reduction.

Fourier Transform: Problem Solving

Covers solutions to a sample midterm, focusing on Fourier transform problems and system interconnections.

Neuro-symbolic Representations: Commonsense Knowledge & Reasoning

Explores neuro-symbolic representations for understanding commonsense knowledge and reasoning, emphasizing the challenges and limitations of deep learning in natural language processing.

Maximum Power Transfer Theorem and Analysis Methods

Explores the Maximum Power Transfer Theorem and Analysis Methods in linear circuits with practical examples.

Node Degree and Strength

Explores brain node connectivity, node degree, strength, random networks, power law distributions, and the complexity of real networks.

Decision Forests: Structure and Training

Covers decision forests, training, weak learners, entropy, boosting, 3D pose estimation, and practical applications.

Search and Routing Protocols

Explores unstructured and structured search and routing protocols, emphasizing the importance of network structure assumptions and introducing the 'Bubble Storm' algorithm.

Big Data Best Practices and Guidelines

Covers best practices and guidelines for big data, including data lakes, architecture, challenges, and technologies like Hadoop and Hive.

Decentralized Systems Engineering

Explores decentralized systems engineering, covering database initialization, reliable messaging, consensus algorithms, and encryption protocols.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.