( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mining Associations Using Directed Hypergraphs.

, , и . ICDE Workshops, стр. 190-197. IEEE Computer Society, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Pratibha Tripathi

Chandrabhal Tripathi

Rahul Gupta

Lalji Tripathi

Namita Tripathi

 

Другие публикации лиц с тем же именем

Identifying high betweenness centrality nodes in large social networks., , , , и . CoRR, (2017)Detecting Sensitive Content in Spoken Language., , , и . DSAA, стр. 374-381. IEEE, (2019)Complexity Results in Graph Reconstruction., , , и . MFCS, том 3153 из Lecture Notes in Computer Science, стр. 287-297. Springer, (2004)On strategy improvement algorithms for simple stochastic games., , и . J. Discrete Algorithms, 9 (3): 263-278 (2011)Estimating Precisions for Multiple Binary Classifiers Under Limited Samples., , и . ECML/PKDD (4), том 12460 из Lecture Notes in Computer Science, стр. 240-256. Springer, (2020)On Strategy Improvement Algorithms for Simple Stochastic Games., , и . CIAC, том 6078 из Lecture Notes in Computer Science, стр. 240-251. Springer, (2010)Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.. MFCS, том 4708 из Lecture Notes in Computer Science, стр. 548-558. Springer, (2007)The 1-Versus-2 Queries Problem Revisited.. ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 137-147. Springer, (2007)Analysis and approximation of optimal co-scheduling on chip multiprocessors., , , и . PACT, стр. 220-229. ACM, (2008)Mining Associations Using Directed Hypergraphs., , и . ICDE Workshops, стр. 190-197. IEEE Computer Society, (2012)