Expertini Research Research

Browse Research Papers

18+ open-access research outputs.

✕ Clear
🔍 anthony rizzi 📂 Computer Science
Showing 18 results for "anthony rizzi" in Computer Science
Computer Science Preprint PDF DOI

From Mirage to Grounding: Towards Reliable Multimodal Circuit-to-Verilog Code Generation

Guang Yang, Xing Hu, Xiang Chen, Xin Xi · 2026

Multimodal large language models (MLLMs) are increasingly used to translate visual artifacts into code, from UI mockups into HTML to scientific plots into Python scripts. A circuit diagram can be view…

Read Paper →
Computer Science Preprint PDF DOI

New Diameter Approximations via Distance Oracle Techniques

Yael Kirkpatrick, Liam Roditty, Richard Qi, Virginia Vassilevska Williams · 2026

Computing the diameter of a graph is a problem of great interest both in general algorithms research and specifically within fine-grained complexity, where it is a cornerstone hard problem. Recent wor…

Read Paper →
Computer Science Preprint PDF DOI

A Novel Multidimensional Reference Model For Heterogeneous Textual Datasets Using Context, Semantic And Syntactic Clues

Ganesh Kumar, Shuib Basri, Abdullahi Abubakar Imam, Abdullateef Oluwaqbemiga Balogun, Hussaini Mamman, Luiz Fernando Capretz · 2023

With the advent of technology and use of latest devices, they produces voluminous data. Out of it, 80% of the data are unstructured and remaining 20% are structured and semi-structured. The produced d…

Read Paper →
Computer Science Preprint PDF DOI

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

Fateme Abbasi, Sandip Banerjee, Jaros{l}aw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Daniel Marx, Roohani Sharma, Joachim Spoerhase · 2023

We consider the well-studied Robust $(k, z)$-Clustering problem, which generalizes the classic $k$-Median, $k$-Means, and $k$-Center problems. Given a constant $z\ge 1$, the input to Robust $(k, z)$-C…

Read Paper →
Computer Science Preprint PDF DOI

Algorithms for subgraph complementation to some classes of graphs

Dhanyamol Antony, Sagartanu Pal, R.B. Sandeep · 2023

For a class $\mathcal{G}$ of graphs, the objective of \textsc{Subgraph Complementation to} $\mathcal{G}$ is to find whether there exists a subset $S$ of vertices of the input graph $G$ such that modif…

Read Paper →
Computer Science Preprint PDF DOI

The Specialized High-Performance Network on Anton 3

Keun Sup Shim, Brian Greskamp, Brian Towles, Bruce Edwards, J.P. Grossman, David E. Shaw · 2022

Molecular dynamics (MD) simulation, a computationally intensive method that provides invaluable insights into the behavior of biomolecules, typically requires large-scale parallelization. Implementati…

Read Paper →
Computer Science Preprint PDF DOI

fauci-email: a json digest of Anthony Fauci's released emails

Austin R. Benson, Nate Veldt, David F. Gleich · 2021

A collection of over 3000 pages of emails sent by Anthony Fauci and his staff were released in an effort to understand the United States government response to the COVID-19 pandemic. We describe how t…

Read Paper →
Computer Science Preprint PDF DOI

Computer-supported Analysis of Positive Properties, Ultrafilters and Modal Collapse in Variants of G\"odel's Ontological Argument

Christoph Benzmuller, David Fuenmayor · 2019

Three variants of Kurt G\"odel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's versi…

Read Paper →
Computer Science Preprint PDF DOI

Affect Enriched Word Embeddings for News Information Retrieval

Tommaso Teofili, Niyati Chhaya · 2019

Distributed representations of words have shown to be useful to improve the effectiveness of IR systems in many sub-tasks like query expansion, retrieval and ranking. Algorithms like word2vec, GloVe a…

Read Paper →
Computer Science Preprint PDF DOI

Learning from History: Recreating and Repurposing Sister Harriet Padberg's Computer Composed Canon and Free Fugue

Richard Savery, Benjamin Genchel, Jason Smith, Anthony Caulkins, Molly Jones, Anna Savery · 2019

Harriet Padberg wrote Computer-Composed Canon and Free Fugue as part of her 1964 dissertation in Mathematics and Music at Saint Louis University. This program is one of the earliest examples of text-t…

Read Paper →
Computer Science Preprint PDF DOI

Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle

Titus Dose · 2019

All versions of this paper contain errors. Therefore, the existence of an oracle relative to which (i) there exist complete disjoint coNP-pairs and (ii) there exist no complete total polynomial search…

Read Paper →
Computer Science Preprint PDF DOI

Improved Deterministic Distributed Matching via Rounding

Manuela Fischer · 2017

We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. Th…

Read Paper →
Computer Science Preprint PDF DOI

Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks -- Extended version with an Improved Upper Bound --

Massimo Cairo, Carlo Comin, Romeo Rizzi · 2016

CSTNs is a constraint-based graph-formalism for conditional temporal planning. In order to address the DC-Checking problem, in [Comin and Rizzi, TIME 2015] we introduced epsilon-DC (a refined, more re…

Read Paper →
Computer Science Preprint PDF DOI

New Approximability Results for the Robust k-Median Problem

Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann · 2013

We consider a robust variant of the classical $k$-median problem, introduced by Anthony et al. \cite{AnthonyGGN10}. In the \emph{Robust $k$-Median problem}, we are given an $n$-vertex metric space $(V…

Read Paper →
Computer Science Preprint PDF DOI

Beyond the Vizing's bound for at most seven colors

Marcin Kaminski, {L}ukasz Kowalik · 2012

Let $G=(V,E)$ be a simple graph of maximum degree $\Delta$. The edges of $G$ can be colored with at most $\Delta +1$ colors by Vizing's theorem. We study lower bounds on the size of subgraphs of $G$ t…

Read Paper →
Computer Science Preprint PDF DOI

Automatic Music Composition using Answer Set Programming

Georg Boenn, Martin Brain, Marina De Vos, John ffitch · 2010

Music composition used to be a pen and paper activity. These these days music is often composed with the aid of computer software, even to the point where the computer compose parts of the score auton…

Read Paper →
Computer Science Peer-Reviewed PDF DOI

High efficiency solar cells as fabricated by Sb2S3-modified TiO2 nanofibrous networks.

 · 1970

High-efficiency hybrid solar cells (HSCs) based on electrospun titanium dioxide (TiO2) nanofibers plus poly(3-hexylthiophene) (P3HT) are fabricated by means of both the pretreatment using tetrahydrofu…

Read Paper →
Computer Science Peer-Reviewed PDF DOI

Effects of continuous use of Entonox in comparison with intermittent method on obstetric outcomes: a randomized clinical trial.

 · 1970

BACKGROUND: Entonox (N2O2) which is an inhalational gas for relieving labor pain is commonly used intermittently; however some women are interested in continuous breathing in face mask. So we decided …

Read Paper →