Cover Image

Digital Avatars: Framework Development and Their Evaluation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rupprecht, Timothy, Chang, Sung-En, Wu, Yushu, Lu, Lei, Nan, Enfu, Li, Chih-hsiang, Lai, Caiyue, Li, Zhimin, Hu, Zhijun, He, Yumei, Kaeli, David, Wang, Yanzhi
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence 68 D.2.2; C.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Understanding and Tackling Over-Dilution in Graph Neural Networks
by: Lee, Junhyun, et al.
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

On the twin-width of near-regular graphs
by: Heinrich, Irene, et al.
Published: (2025)

A Study of Digital Appliances Accessibility for People with Visual Disabilities
by: An, Hyunjin, et al.
Published: (2024)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

DAG Scheduling in the BSP Model
by: Papp, Pál András, et al.
Published: (2023)

Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
by: Feng, Zhidan, et al.
Published: (2024)

AI for software engineering: from probable to provable
by: Meyer, Bertrand
Published: (2025)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
by: Bampis, Evripidis, et al.
Published: (2024)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

Reasoning aligns language models to human cognition
by: Guiomar, Gonçalo, et al.
Published: (2026)

TDAD: Test-Driven Agentic Development - Reducing Code Regressions in AI Coding Agents via Graph-Based Impact Analysis
by: Alonso, Pepe, et al.
Published: (2026)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
by: Rose, Valentino Delle, et al.
Published: (2023)

Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
by: Zhang, Wenjing, et al.
Published: (2025)

Approaching I/O-optimality for Approximate Attention
by: Papp, Pál András, et al.
Published: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Diameter Constraints in 2-distance Graphs
by: Al-saadi, Oleksiy, et al.
Published: (2025)

Set Parameterized Matching via Multi-Layer Hashing
by: Lewenstein, Moshe, et al.
Published: (2026)

Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
by: Díaz-Báñez, J. M., et al.
Published: (2022)

Case Studies and Reflections on Agentic Software Engineering for Rapid Development of Digital Music Instruments
by: Yee-King, Matthew John
Published: (2026)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)

Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
by: Laekhanukit, Bundit
Published: (2024)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
by: Morse, Gregory, et al.
Published: (2026)

Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)

DRO-InstructZero: Distributionally Robust Prompt Optimization for Large Language Models
by: Li, Yangyang
Published: (2025)

Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains-Algorithmic Perspective
by: Al-atar, Munqath, et al.
Published: (2024)

Sparse Knowledge Distillation: A Mathematical Framework for Probability-Domain Temperature Scaling and Multi-Stage Compression
by: Flouro, Aaron R., et al.
Published: (2026)

Approximate Integrity Constraints in Incomplete Databases With Limited Domains
by: Al-atar, Munqath, et al.
Published: (2024)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

Large cliques and large independent sets: can they coexist?
by: Feige, Uriel, et al.
Published: (2025)

LLM Agents for Generating Microservice-based Applications: how complex is your specification?
by: Yellin, Daniel M.
Published: (2025)