Zobrazeno 1 - 10
of 149
pro vyhledávání: '"Mohades, Ali"'
Autor:
Rajabi, Fatemeh, Mohades, Ali
In elections around the world, the candidates may turn their campaigns toward negativity due to the prospect of failure and time pressure. In the digital age, social media platforms such as Twitter are rich sources of political discourse. Therefore,
Externí odkaz:
http://arxiv.org/abs/2311.00143
Intent Detection is one of the tasks of the Natural Language Understanding (NLU) unit in task-oriented dialogue systems. Out of Scope (OOS) and Out of Domain (OOD) inputs may run these systems into a problem. On the other side, a labeled dataset is n
Externí odkaz:
http://arxiv.org/abs/2303.04134
Autor:
Akbari, Masoud, Karimi, Amir Hossein, Saeedi, Tayyebeh, Saeidi, Zeinab, Ghezelbash, Kiana, Shamsezat, Fatemeh, Akbari, Mohammad, Mohades, Ali
Natural Language Understanding (NLU) is important in today's technology as it enables machines to comprehend and process human language, leading to improved human-computer interactions and advancements in fields such as virtual assistants, chatbots,
Externí odkaz:
http://arxiv.org/abs/2303.00408
Autor:
Mohades, Ali, Lederer, Johannes
High-dimensional data has become ubiquitous across the sciences but presents computational and statistical challenges. A common approach to addressing these challenges is through sparsity. In this paper, we introduce a new concept of sparsity, called
Externí odkaz:
http://arxiv.org/abs/2302.08235
Autor:
Maleki, Shiva, Mohades, Ali
Victor Klee introduce the art gallery problem during a conference in Stanford in August 1976 with that question: "How many guards are required to guard an art gallery?" In 1987, Ghosh provided an approximation algorithm for vertex guards problem that
Externí odkaz:
http://arxiv.org/abs/2201.03535
Publikováno v:
Fundamenta Informaticae, Volume 184, Issue 3 (January 27, 2022) fi:8776
The $k$-center problem is to choose a subset of size $k$ from a set of $n$ points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\ldots,Q_n\}$ be a set of polygons or segments in the region-based uncer
Externí odkaz:
http://arxiv.org/abs/2111.13989
Finding the appropriate words to convey concepts (i.e., lexical access) is essential for effective communication. Reverse dictionaries fulfill this need by helping individuals to find the word(s) which could relate to a specific concept or idea. To t
Externí odkaz:
http://arxiv.org/abs/2105.00309
A polygonal curve $P$ with $n$ vertices is $c$-packed, if the sum of the lengths of the parts of the edges of the curve that are inside any disk of radius $r$ is at most $cr$, for any $r>0$. Similarly, the concept of $c$-packedness can be defined for
Externí odkaz:
http://arxiv.org/abs/2012.04403
In this paper we study the problem of computing the geodesic center of a simple polygon when the available workspace is limited. For an $n$-vertex simple polygon, we give a time-space trade-off algorithm that finds the geodesic center in $O(T(n, s) \
Externí odkaz:
http://arxiv.org/abs/1908.11260
Let $S$ be a set of $n$ points in the plane, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that $\theta\leq 2\pi-\fr
Externí odkaz:
http://arxiv.org/abs/1807.10926