Delve into innovative research interests focusing on knowledge base construction using fictional texts as archetypes, taxonomies for constructing knowledge bases, and extraction of commonsense knowledge from diverse sources. Challenges such as sparsity and semantics are addressed through comprehensi

3 views • 48 slides

A novel indoor millimeter-wave imaging system based on sparsity estimated compressed sensing and calibrated point spread function is introduced. The system utilizes a unique calibration procedure to process the point spread function acquired from measuring a suspended point scatterer. By estimating

2 views • 26 slides

This article explores the concept of generating interpretable, diverse, and plausible counterfactual explanations within explainable AI (XAI). It highlights the challenges with current methods, introduces an instance-guided approach, and emphasizes the importance of good counterfactuals. The discuss

0 views • 22 slides

This paper discusses constant-time algorithms for sparsity matroids, focusing on (k, l)-sparse and (k, l)-full matroids in graphic representations. It explores properties, testing methods, and graph models like the bounded-degree model. The objective is to efficiently determine if a graph satisfies

0 views • 21 slides

In the realm of large-scale search and machine learning, implementing efficient solutions for text document retrieval is crucial. Techniques like inverted index and bitwise operations help overcome challenges of storage and sparsity in managing vast collections of documents. Measures like precision

0 views • 17 slides

Explore the concept of matroids and representative sets in game theory, focusing on Alice vs. Bob scenarios where Alice aims to win by strategically selecting sets. Learn how Bollob's Lemma plays a key role in helping Alice reduce the number of sets she needs to remember to secure victory.

0 views • 44 slides

Variants of the Secretary Problem with matroid constraints have been explored, allowing for hiring multiple secretaries based on certain constraints to maximize total value. The Matroid Secretary Problem, a crucial variant, presents challenges and opportunities for algorithmic solutions in various a

0 views • 16 slides

CCN commissioned Pixel Financial Management to model potential implications of the Fair Funding Review (FFR) to support their responses to current and future consultations. The FFR consultation paper by MHCLG deals with needs in the formula, with future papers focusing on resources and damping. The

0 views • 26 slides

Quantum error-correcting codes (QECC) play a crucial role in protecting quantum information from errors. Stabilizer codes with fault-tolerant error-detecting circuits can lead to the construction of resilient subsystem codes. These codes involve encoding logical qubits into physical qubits and error

0 views • 26 slides

This research by Dr. Yu Zheng aims to estimate travel time on road networks instantly using historical and current trajectories generated by vehicles. The methodology involves a context-aware tensor decomposition approach, optimal concatenation, and frequent trajectory pattern mining to address chal

0 views • 21 slides

This presentation discusses the importance of link prediction in social networks, including applications like recommending new friends, predicting actor participation in events, suggesting interactions between organizations, and overcoming data sparsity in recommender systems. It covers motivations,

0 views • 99 slides