https://cis.temple.edu/~latecki/Courses/CIS2033-Spring12/ElementaryProbabilityforApplications/ch3.pdf
5/36 5 The same result holds if B = “The first die is k” and 2 ≤ k ≤ 6. Carrying this reasoning further, we see that given the outcome lies in A, all five possibilities have the same probability. This should not be surprising. The original probabil-ity is uniform over the 36 possibilities, so when we condition on the occurrence of A, its five outcomes are equally likely.
https://news.temple.edu/news/2024-09-20/flappy-bird-return-after-10-year-hiatus-true-story-behind-world-s-most-viral-mobile
Temple University film and media arts faculty member Thomas Sharpe discusses the rise, fall and 2025 return of Flappy Bird, the world’s most viral mobile game.
https://www.fox.temple.edu/faculty-research/institutes-centers/innovation-entrepreneurship-institute/competitions/changemaker-challenge
The need to address global and social issues is becoming increasingly important. The Innovation & Entrepreneurship Institute at Temple University established the Changemaker Challenge to encourage the development and creation of social impact ideas and ventures with the aim of creating positive change in local communities and around the world. As part of Temple University’s Social Impact ...
https://scholarshare.temple.edu/bitstreams/1c1f1a6d-0f34-4234-8b39-41d9eeb397f0/download
of machine learning (ML) versus a traditional statistical model in predicting dental caries in
https://cis.temple.edu/~latecki/Courses/CIS617-04/Solutions/archana_guptaHW1.pdf
Solutions by Archana Gupta Question 1 (Chapter 3: 10) An 8-bit byte with binary value 10101111 is to be encoded using an even-parity Hamming code. What is the binary value after encoding?
https://sites.temple.edu/wise2022/files/2022/11/WISE-2022-Schedule-and-Program-11.24.22.pdf
December 14-16, 2022, Copenhagen Business School, Denmark Preliminary – Subject to Change
https://cis.temple.edu/~jiewu/research/publications/Publication_files/Distributed_Deep_Multi-Agent_Reinforcement_Learning_for_Cooperative_Edge_Caching_in_Internet-of-Vehicles.pdf
Abstract—Edge caching is a promising approach to reduce duplicate content transmission in Internet-of-Vehicles (IoVs). Sev-eral Reinforcement Learning (RL) based edge caching methods have been proposed to improve the resource utilization and reduce the backhaul trafic load. However, they only obtain the local sub-optimal solution, as they neglect the influence from environments by other ...
https://cis.temple.edu/~latecki/Papers/QiJia_Ellipse_IEEETIP_2023.pdf
Abstract—It is challenging to characterize the intrinsic geom-etry of high-degree algebraic curves with lower-degree algebraic curves. The reduction in the curve’s degree implies lower com-putation costs, which is crucial for various practical computer vision systems. In this paper, we develop a characteristic mapping (CM) to recursively degenerate 3n points on a planar curve of nth order ...
https://cis.temple.edu/~latecki/Papers/PAMIshape08.pdf
Xiang Bai and Longin Jan Latecki, Senior Member, IEEE Abstract—This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geodesic paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we do not consider the topological graph structure. Our ...