Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Swaroop N. Prabhakar"'
Publikováno v:
IEEE Access, Vol 10, Pp 124990-124998 (2022)
Can we perform Neural Architecture Search (NAS) with a smaller subset of target dataset and still fair better in terms of performance with significant reduction in search cost? In this work, we propose a method, called DistilNAS, which utilizes a cur
Externí odkaz:
https://doaj.org/article/08f75ed939494c32925b0a547abf7254
Autor:
Vikram Sharma, Swaroop N. Prabhakar
Publikováno v:
ISSAC
A multivariate polynomial F ( x 1 , x 2 , … , x n ) is said to be absolutely positive from a real number B if F and all its partial derivatives are non-negative for x 1 , x 2 , … , x n ≥ B . One of the well known bounds on absolute positiveness
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3eabbc25aa8750cc73d7b99e14779bc4
https://doi.org/10.1145/3087604.3087631
https://doi.org/10.1145/3087604.3087631
Autor:
Vikram Sharma, Swaroop N. Prabhakar
Publikováno v:
Computer Algebra in Scientific Computing ISBN: 9783319456409
CASC
CASC
In this paper, we study a bound on the real roots of a polynomial by Lagrange. From known results in the literature, it follows that Lagrange’s bound is also a bound on the absolute positiveness of a polynomial. A simple \(O(n\log n)\) algorithm de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f2301e60abc7bb8b10d69ab8b44a355
https://doi.org/10.1007/978-3-319-45641-6_28
https://doi.org/10.1007/978-3-319-45641-6_28
