Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Eswaran, K. P."'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Eswaran, K.
This paper investigates the analytic properties of the Liouville function's Dirichlet series that obtains from the function F(s)= zeta(2s)/zeta(s), where s is a complex variable and zeta(s) is the Riemann zeta function. The paper employs a novel meth
Externí odkaz:
http://arxiv.org/abs/1609.06971
As machine learning is applied to an increasing variety of complex problems, which are defined by high dimensional and complex data sets, the necessity for task oriented feature learning grows in importance. With the advancement of Deep Learning algo
Externí odkaz:
http://arxiv.org/abs/1607.01354
Autor:
Eswaran, K., Rao, K. Damodhar
Recently an algorithm, was discovered, which separates points in n-dimension by planes in such a manner that no two points are left un-separated by at least one plane{[}1-3{]}. By using this new algorithm we show that there are two ways of classifica
Externí odkaz:
http://arxiv.org/abs/1512.04509
Autor:
Eswaran, K.
We show that if you represent all primes with less than n-digits as points in n-dimensional space, then they can be stored and retrieved conveniently using n-dimensional geometry. Also once you have calculated all the prime numbers less than n digits
Externí odkaz:
http://arxiv.org/abs/1511.08941
Autor:
Eswaran, K.
Given a set of N points, we have discovered an algorithm that can separate these points from one another by n-dimensional planes. Each point is chosen at random and put into a set S and planes which separate them are determined and put into S. The al
Externí odkaz:
http://arxiv.org/abs/1509.08742
Autor:
Eswaran, K., Singh, Vishwajeet
In this paper we introduce a new method which employs the concept of "Orientation Vectors" to train a feed forward neural network and suitable for problems where large dimensions are involved and the clusters are characteristically sparse. The new me
Externí odkaz:
http://arxiv.org/abs/1509.05177
Autor:
Eswaran, K.
The problem of optimizing a linear objective function,given a number of linear constraints has been a long standing problem ever since the times of Kantorovich, Dantzig and von Neuman. These developments have been followed by a different approach pio
Externí odkaz:
http://arxiv.org/abs/1303.4942
Autor:
Eswaran, K.
In this paper we consider a classical treatment of a very dense collection of photons forming a self-sustained globe under its own gravitational influence. We call this a "photonic globe" We show that such a dense photonic globe will have a radius cl
Externí odkaz:
http://arxiv.org/abs/1303.3818
Autor:
Deepthi, Dasika Ratna, Eswaran, K.
Publikováno v:
International Journal of Computer Science and Information Security, IJCSIS, Vol. 6, No. 1, pp. 016-025, October 2009, USA
In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping which classif
Externí odkaz:
http://arxiv.org/abs/0911.0225