Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Janardhanan, Mano Vikash"'
Financial documents are filled with specialized terminology, arcane jargon, and curious acronyms that pose challenges for general-purpose text embeddings. Yet, few text embeddings specialized for finance have been reported in the literature, perhaps
Externí odkaz:
http://arxiv.org/abs/2411.07142
Autor:
Janardhanan, Mano Vikash, Reyzin, Lev
In this paper, we consider the problem of reconstructing a directed graph using path queries. In this query model of learning, a graph is hidden from the learner, and the learner can access information about it with path queries. For a source and des
Externí odkaz:
http://arxiv.org/abs/2002.11541
$Anomaly$ $detection$ problems (also called $change$-$point$ $detection$ problems) have been studied in data mining, statistics and computer science over the last several decades in applications such as medical condition monitoring and weather change
Externí odkaz:
http://arxiv.org/abs/1808.05676
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue of local ma
Externí odkaz:
http://arxiv.org/abs/1808.02368
In this paper, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also study the linear local matching pro
Externí odkaz:
http://arxiv.org/abs/1808.01376
In this paper, we study the problem of constructing a network by observing ordered connectivity constraints, which we define herein. These ordered constraints are made to capture realistic properties of real-world problems that are not reflected in p
Externí odkaz:
http://arxiv.org/abs/1702.07292
In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue of locall
Externí odkaz:
http://arxiv.org/abs/1601.06322
Autor:
Janardhanan, Mano Vikash
Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of these $r$
Externí odkaz:
http://arxiv.org/abs/1404.7348
Given positive integers $n$ and $k$, a $k$-term semi-progression of scope $m$ is a sequence $(x_1,x_2,...,x_k)$ such that $x_{j+1} - x_j \in \{d,2d,\ldots,md\}, 1 \le j \le k-1$, for some positive integer $d$. Thus an arithmetic progression is a semi
Externí odkaz:
http://arxiv.org/abs/1401.2808
Publikováno v:
In Linear Algebra and Its Applications 1 December 2019 582:138-155
