Search Results for author:
Found 8 papers, 2 papers with code
Budgeted Online Influence Maximization
We introduce a new budgeted framework for online influence maximization, considering the total cost of an advertising campaign instead of the common cardinality constraint on a chosen influencer set.
“It doesn’t look good for a date”: Transforming Critiques into Preferences for Conversational Recommendation Systems
Conversations aimed at determining good recommendations are iterative in nature.
Automatic Layout Planning for Visually-Rich Documents with Instruction-Following Models
Recent advancements in instruction-following models have made user interactions with models more user-friendly and efficient, broadening their applicability.
Gaudí: Conversational Interactions with Deep Representations to Generate Image Collections
Based on recent advances in realistic language modeling (GPT-3) and cross-modal representations (CLIP), Gaud\'i was developed to help designers search for inspirational images using natural language.
Multiscale Manifold Warping
Many real-world applications require aligning two temporal sequences, including bioinformatics, handwriting recognition, activity recognition, and human-robot coordination.
"It doesn't look good for a date": Transforming Critiques into Preferences for Conversational Recommendation Systems
Conversations aimed at determining good recommendations are iterative in nature.
Developing a Conversational Recommendation System for Navigating Limited Options
We have developed a conversational recommendation system designed to help users navigate through a set of limited options to find the best choice.
On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions
We demonstrate that from an algorithm guaranteeing an approximation factor for the ratio of submodular (RS) optimization problem, we can build another algorithm having a different kind of approximation guarantee -- weaker than the classical one -- for the difference of submodular (DS) optimization problem, and vice versa.
Data Structures and Algorithms
