Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Dominic Yang"'
Publikováno v:
IEEE Transactions on Network Science and Engineering, vol 10, iss 4
Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify these effects and how to use symmetries to increase the efficiency of s
Publikováno v:
Discrete & Computational Geometry. 65:916-937
Tverberg’s theorem says that a set with sufficiently many points in $${\mathbb {R}}^d$$ can always be partitioned into m parts so that the $$(m-1)$$ -simplex is the (nerve) intersection pattern of the convex hulls of the parts. The main results of
We consider nonlinear optimization problems that involve surrogate models represented by neural networks. We demonstrate first how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17f954826f1d20ccee8f1f9be33ddfc8
Autor:
Dominic Yang, Thomas K. Tu
Publikováno v:
IEEE BigData
In the context of networks curated from real world data, an important problem is that of aligning entities across multiple data sources. Methods for performing alignment are often error-prone due to lack of information and noise within the data itsel
Publikováno v:
IEEE BigData
We present an approach for inexact subgraph matching on attributed graphs optimizing the graph edit distance. By combining lower bounds on the cost of individual assignments, we obtain a heuristic for a backtracking tree search to identify optimal so
Publikováno v:
IEEE BigData
Structural Equivalence refers to the ability to exchange two vertices in a graph without changing the structure of the graph. We provide basic definitions and properties applicable to the subgraph isomorphism problem. We show examples of structural e
Publikováno v:
2018 IEEE International Conference on Probabilistic Methods Applied to Power Systems (PMAPS).
Stochastic versions of the unit commitment problem have been advocated for addressing the uncertainty presented by high levels of wind power penetration. However, little work has been done to study trade-offs between computational complexity and the
Autor:
S. W. Pelletier, Dominic Yang
Publikováno v:
Chem. Commun. (London). :1055-1057
Autor:
HIROSHI ITO, ELSA REICHMANIS, OMKARAM NALAMASU, TAKUMI UENO, Christopher Harrison, Miri Park, Paul M. Chaikin, Richard A. Register, Douglas H. Adamson, Joachim P. Spatz, Thomas Herzog, Stefan Mössmer, Paul Ziemann, Martin Möller, C. B. Gorman, R. W. Vest, J. L. Snover, T. L. Utz, S. A. Serron, Hiroyuki Niino, Akira Yabe, Ross H. Hill, Sharon L. Blair, T. Hanemann, V. Piotter, R. Ruprecht, J. H. Hausselt, H.-T. Schacht, P. Falcigno, N. Münzel, R. Schulz, A. Medina, Wu-Song Huang, Kim Y. Lee, Rao Bantu, Ranee Kwong, Ahmad Katnani, Mahmoud Khojasteh, William Brunsvold, Steven Holmes, Ronald Nunes, Tsuyoshi Shibata, George Orsula, James Cameron, Dominic Yang, Roger Sinta, Toshiro Itani, Hiroshi Yoshino, Shuichi Hashimoto, Mitsuharu Yamana, Norihiko Samoto, Kunihiko Kasama, Kieko Harada, Masahito Kushida, Kyoichi Saito, Kazuyuki Sugita, Hirotada Iida, James W. Taylor, Paul M. Dentinger, Steven J. Rhyner, Geoffrey W. Reynolds, G. G. Barclay, M. King, A. Orellana, P. R. L. Malenfant, R. Sinta, E. Malmstrom, H. Ito, C. J. Hawker, Kunihiro Ichimura, Koji Arimitsu