Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Dandapani Sivakumar"'
Autor:
Sumit Sanghai, Bin Shu, Zac Yu, Qifan Wang, Jon Elsas, Bhargav Kanagal, Li Yang, Dandapani Sivakumar
Publikováno v:
KDD
Attribute value extraction refers to the task of identifying values of an attribute of interest from product information. It is an important research topic which has been widely studied in e-Commerce and relation learning. There are two main limitati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9706e6daaf531f9b8a8329d2316ecde
https://doi.org/10.1145/3394486.3403047
https://doi.org/10.1145/3394486.3403047
Autor:
Dandapani Sivakumar, S. Balasubramonian, Shekhar Kumar, M. Sampath, Alok Kumar Mishra, Pranay Kumar Sinha, N.K. Pandey
Publikováno v:
Journal of Radioanalytical and Nuclear Chemistry. 314:975-983
The simultaneous extraction of uranyl nitrate and nitric acid by 36 vol.% tri-iso-amyl phosphate (TiAP) in n-dodecane was experimentally studied and modeled. The batch extraction experiments were carried out at low concentration region of aqueous ura
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::481d43d59482f4d76ad33ccd3c1876f3
https://doi.org/10.1007/s10967-017-5474-9
https://doi.org/10.1007/s10967-017-5474-9
Publikováno v:
CIKM
In this paper, we consider the problem of constructing a comprehensive database of events taking place around the world. Events include small hyper-local events like farmer's markets, neighborhood garage sales, as well as larger concerts and festival
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27c3a89c770409705a2e000760ab3a74
https://doi.org/10.1145/3357384.3357986
https://doi.org/10.1145/3357384.3357986
Publikováno v:
SIAM Journal on Discrete Mathematics. 30:1978-1996
We offer a novel classification of voting methods popular in social choice theory. Our classification is based on the more general problem of rank aggregation in which, beyond electing a winner, we also seek to compute an aggregate ranking of all the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad5664dd82f58d29821857bf37df169d
https://doi.org/10.1137/15m1046915
https://doi.org/10.1137/15m1046915
Autor:
M. Sampath, Ravi Kant Srivastav, Dandapani Sivakumar, U. Kamachi Mudali, S. Balasubramonian, Shekhar Kumar, Pranay Kumar Sinha
Publikováno v:
Journal of Radioanalytical and Nuclear Chemistry. 295:1703-1707
Akademiai Kiado ´, Budapest, Hungary 2012 Abstract Several solutions of 30 % TBP/n-dodecane were equilibrated with different concentrations of aqueous nitric acid solutions at 298.15 K at a phase ratio of unity. The resultant equilibrated aqueous an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96a050686dfdd4e679f01bae77ed0c32
https://doi.org/10.1007/s10967-012-1984-7
https://doi.org/10.1007/s10967-012-1984-7
Autor:
Shekhar Kumar, R. Natarajan, M. Sampath, Dandapani Sivakumar, Bijendra Kumar, U. Kamachi Mudali
Publikováno v:
Journal of Radioanalytical and Nuclear Chemistry. 289:861-864
Recently authors demonstrated direct dissolution of g-level PHWR UO2 fuel pellet fragments and in situ extraction by TBP-HNO3 and TiAP-HNO3 solutions at atmospheric pressures. Extending the work, similar studies were performed on intact unirradiated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddc27a815f776fa97546a7597d5381e6
https://doi.org/10.1007/s10967-011-1165-0
https://doi.org/10.1007/s10967-011-1165-0
Publikováno v:
Theory of Computing. 4:129-135
Consider the following version of the Hamming distance problem for ±1 vec- tors of length n: the promise is that the distance is either at least n + p n or at most n p n, and the goal is to find out which of these two cases occurs. Woodruff (Proc. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb608ce7cd22b6b03273cf4d4f827b0e
https://doi.org/10.4086/toc.2008.v004a006
https://doi.org/10.4086/toc.2008.v004a006
Publikováno v:
SIAM Journal on Discrete Mathematics. 20:628-648
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5dcf81eb20f12f43aae4ed1e7c2ba86
https://doi.org/10.1137/05063088x
https://doi.org/10.1137/05063088x
Publikováno v:
FOCS
We present a new method for proving strong lower bounds in communication complexity. This method is based on the notion of the conditional information complexity of a function which is the minimum amount of information about the inputs that has to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93031b2efe85ed170c2f169e5f8a0d66
Publikováno v:
Internet Mathematics. 1:277-304
We anticipate that future web search techniques will exploit changes in web structure and content. As a first step in this direction, we examine the problem of integrating observed changes in link structure into static hyperlink-based ranking computa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c608ce09ec9a3b6e974ea67ed2232e78
https://doi.org/10.1080/15427951.2004.10129090
https://doi.org/10.1080/15427951.2004.10129090