Monocular, One-stage, Regression of Multiple 3D People and their 3D positions & trajectories in camera & global coordinates. ROMP[ICCV21], BEV[CVPR22], TRACE[CVPR2023]

This is Pytorch re-implementation of our CVPR 2020 paper "Panoptic-DeepLab: A Simple, Strong, and Fast Baseline for Bottom-Up Panoptic Segmentation" (https://arxiv.org/abs/1911.10194)

Simple Pose: Rethinking and Improving a Bottom-up Approach for Multi-Person Pose Estimation

Layering system for React. Useful for popover/modals/tooltip/dnd application

Bottom-up whole-body pose estimation method in constant time.

Code for "Greedy Offset-Guided Keypoint Grouping for Human Pose Estimation"

A Pytorch implementation of the paper 'Bottom-Up and Top-Down Attention for Image Captioning and Visual Question Answering'

This repo consists codes of Aditya Verma - Dynamic Programming Playlist

A Datalog interpreter implementing the Well-Founded semantics.

Analysis of a cities dataset with 3 algorithms: K-means, K-medoids, and Bottom-Up Hierarchical Clustering

Complete runnable demo code of article "A Bottom-Up View of Kotlin Coroutines"

Code of Thesis to pursue an M.Sc. in Water Resources

Implementation of the 0-1 Knapsack Problem

A Framework for IMS-MS Raw Data Processing written in Rust and Python.

Community Network Resource Mapping toolkit provides a big picture of the supply, support, and aid capacity and needs of a community, to support effective and efficient collaboration inside and between communities.

Top-down and bottom-up parsers for JSON files with C++ API

Code base for our paper "Connectivity-Inspired Network for Context-Aware Recognition" (ECCV 2024, Human-inspired Computer Vision workshop)

Extended BURS generator

✔️ Aplicação de testes de integração: Bottom-up (atividade desenvolvida para a disciplina de Qualidade e Testes de Software na FATEC de São José dos Campos)

This Java-based project aims to efficiently solve the robot pathfinding problem, calculating the path that a robot should take to minimize energy consumption while moving from the top-left corner to the bottom-right corner of a square grid of size n x n. The problem is solved using Dynamic Programming, specifically employing a bottom-up approach.