Search Results for author:
Found 12 papers, 2 papers with code
A Dataset for Metaphor Detection in Early Medieval Hebrew Poetry
There is a large volume of late antique and medieval Hebrew texts.
Selecting Walk Schemes for Database Embedding
We study the embedding of the tuples of a relational database, where existing techniques are often based on optimization tasks over a collection of random walks from the database.
Accelerating the Global Aggregation of Local Explanations
% We devise techniques for accelerating the global aggregation of the Anchor algorithm.
Stable Tuple Embeddings for Dynamic Databases
We study the problem of computing an embedding of the tuples of a relational database in a manner that is extensible to dynamic changes of the database.
Knowledge Graphs
Databases
Probabilistic Inference of Winners in Elections by Independent Random Voters
We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain.
Computer Science and Game Theory Computational Complexity
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
For each of the two problems, we give a decidable characterization (under conventional complexity assumptions) of the class of tractable lexicographic orders for every CQ without self-joins.
Databases Data Structures and Algorithms
Computing the Extremal Possible Ranks with Incomplete Preferences
When voter preferences are known in an incomplete manner as partial orders, a candidate can be a possible/necessary winner based on the possibilities of completing the partial votes.
Computer Science and Game Theory Computational Complexity
Geosocial Location Classification: Associating Type to Places Based on Geotagged Social-Media Posts
We explore two approaches to the problem: (a) a pipeline approach, where each message is first classified, and then the location associated with the message set is inferred from the individual message labels; and (b) a joint approach where the individual messages are simultaneously processed to yield the desired location type.
Computational Social Choice Meets Databases
At the conceptual level, we give rigorous semantics to queries in this framework by introducing the notions of necessary answers and possible answers to queries.
Flexible Caching in Trie Joins
An important advantage of LFTJ is its small memory footprint, due to the fact that intermediate results are full tuples that can be dumped immediately.
Databases
Declarative Statistical Modeling with Datalog
By virtue of extending Datalog, our framework offers a natural integration with the database, and has a robust declarative semantics.
