https://scholarshare.temple.edu/items/9514515d-1729-485e-bc42-aaa255c50314
DSpace - scholarshare.temple.edu ... DSpace
https://cis.temple.edu/~giorgio/cis587/readings/constraints.html
+--+--+ |1 |2 | with domains: {aa,bb} for 1ACROSS +--+--+ {ac,bd} for 1DOWN |3 | | {cc,dd} for 3ACROSS +--+--+ {ad,bc} for 2DOWN
https://cis.temple.edu/~jiewu/research/publications/Publication_files/WENJUNJIANG2021TWeb.pdf
Algorithm 2 EMC-RS: The aspect-based EMC-review selection algorithm Input: Set of reviews and aspect set ; Eficiency function Ef; parameters , Output: A set of reviews ∗ ⊆ ∗ 1: ←− ∅ 2: while ( ∗) <| | do 3: Initialize two dictionaries and
https://www.fox.temple.edu/directory/xueming-luo-tuf35198
Biography Xueming Luo is Charles Gilliland Distinguished Chair Professor of Marketing, Professor of Strategic Management, Professor of Management Information Systems. He is the Founder/Director of the Global Institute for Artificial Intelligence and Business Analytics in the Fox School of Business at Temple University. He is interested in digital mobile marketing, omnichannel customer ...
https://scholarshare.temple.edu/bitstreams/b1ecc345-7a7c-4776-a366-9b5585e714d6/download
London: J. Murray; 1859. Vaughan TG. IcyTree: rapid browser-based visualization for phylogenetic trees and networks. Bioinformatics. 2017;33:btx155. Kreft Ł, Botzki A, Coppens F, Vandepoele K, Van Bel M. PhyD3: a phylogenetic tree viewer with extended phyloXML support for functional genomics data visualization. Bioinformatics. 2017;33(18):2946 ...
https://cis.temple.edu/~jiewu/research/publications/Publication_files/FedCPD.pdf
Despite partially mitigating historical information forgetting, this strategy’s ef-ficacy in extracting local features declines when client data exhibits substantial heterogeneity.
https://cis.temple.edu/~latecki/Papers/DSP_PAMI2014.pdf
Abstract—In this paper, we present a novel partition framework, called dense subgraph partition (DSP), to automatically, precisely and efficiently decompose a positive hypergraph into dense subgraphs. A positive hypergraph is a graph or hypergraph whose edges, except self-loops, have positive weights. We first define the concepts of core subgraph, conditional core subgraph, and disjoint ...
https://cis.temple.edu/~latecki/Courses/RobotFall08/BishopBook/Pages_from_PatternRecognitionAndMachineLearning-2.pdf
in Figure 8.17. The joint distribution corresponding to this graph is again obtained from our general form p(a, b, c) = p(a)p(c a)p(bc). | | (8.26) es are observed. Again, we can test to see if a and b are independent by marginalizi
https://cis.temple.edu/~latecki/Papers/GIFT-IEEEMM2017.pdf
In summary, we call the feature in (12) Aggregated Contextual Activation (ACA). Next, we will introduce some improvements of (12) concerning its retrieval accuracy and computational ef-ficiency. 1) Improving Accuracy: Similar to diffusion process, the proposed ACA requires an accurate estimation of the context in the data manifold.