Search Results for author:
Found 6 papers, 4 papers with code
Two-Stage Classifier for Campaign Negativity Detection using Axis Embeddings: A Case Study on Tweets of Political Users during 2021 Presidential Election in Iran
By running the best model on the rest of the tweets of 50 political users that were published one year before the election and with the help of statistical models, we find that the publication of a tweet by a candidate has nothing to do with the negativity of that tweet, and the presence of the names of political persons and political organizations in the tweet is directly related to its negativity.
A Hybrid Architecture for Out of Domain Intent Detection and Intent Discovery
On the other side, a labeled dataset is needed to train a model for Intent Detection in task-oriented dialogue systems.
Ranked #1 on
Intent Discovery
on Persian-ATIS
A Persian Benchmark for Joint Intent Detection and Slot Filling
To evaluate the effectiveness of our benchmark, we employ state-of-the-art methods for intent detection and slot filling.
PREDICT: Persian Reverse Dictionary
Finding the appropriate words to convey concepts (i. e., lexical access) is essential for effective communication.
Computing The Packedness of Curves
Assuming $L$ is the diameter of $P$ and $\delta$ is the minimum distance between points on disjoint edges of $P$, we show the approximation factor of the existing $O(\frac{\log (L/\delta)}{\epsilon}n^3)$ time algorithm is $1+\epsilon$-approximation algorithm.
Computational Geometry
An efficient approximation for point-set diameter in higher dimensions
In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$ time and $O(n)$ space, where $0 < \varepsilon\leqslant 1$.
Computational Geometry 65D18 68W25 68U05
