The IDC CS Colloquium
Fetal MRI has the potential to complement US imaging and improve fetal development assessment by providing more accurate volumetric information about the fetal structures. However, volumetric measurements require manual delineation of the fetal structures, which is time consuming, annotator-dependent, and error-prone.
מערכות בריאות בעולם הולכות ומפנימות שהסטטוס קוו אינו בר קיימא, ושנדרש עיצוב מחדש של שירותי הבריאות בעידן הנוכחי.
ההתקדמות הטכנולוגית המואצת מייצרת הזדמנויות אך המערכות הנוקשות מתקשות להסתגל.
Internet traffic classification has been intensively studied over the past decade due to its importance for traffic engineering and cyber security. However, identifying the type of a network flow or a specific application become harder in recent years due to the use of encryption, e.g., by VPN and Tor.
The potential of the Extract Method refactoring for maintaining high-quality software is well-recognized. It can be useful by itself, or as a building block in larger refactoring tasks.
כיצד המיתו גליליאו, דקארט, וניוטון את החומרים ששלטו במדע של ימי הביניים - כדי לפנות את הבמה לעולם שנשלט על ידי חוקי טבע אוניברסליים - שבחשבון אחרון אינן אלא נוסחאות.
A decision tree (DT) is one of the most popular and efficient techniques in data mining. Specifically, in the clinical domain, DTs have been widely used thanks to their relatively easy explainable nature, efficient computation time, and relatively accurate predictions. However, some DT constriction algorithms may produce a large tree-size structure which is difficult to understand and often leads to misclassification of data in the testing process due to poor generalization.
Deep Learning (DL) has shown great promise in the unsupervised task of clustering. That said, while in classical (i.e., non-deep) clustering the benefits of the nonparametric approach are well known, most deep-clustering methods are parametric: namely, they require a predefined and fixed number of clusters, denoted by K. When K is unknown, however, using model-selection criteria to choose its optimal value might become computationally expensive, especially in DL as the training process would have to be repeated numerous times.
I will give a short introduction to generative diffusion models and present their performance compared to other generative models (including GANs). Moreover, I will present two additional works:
Statistical hypothesis test is a fundamental tool in statistics, where one can determine whether to accept or reject the null hypothesis (the default statement of no difference). Rejecting the null hypothesis means that the probability of getting the observed results is very low - lower than a predetermined significance level. This probability is called a p-value and the lower the p-value is the more significant the results.
Many of the basic algorithmic questions deal with the geometry of graphs. We know many variations on the theme of computing the metric of edge-weighted graphs. E.g., “all-pairs shortest paths”. As I will try to convey in this lecture, there is much that we know beyond that as well as broad barely charted territories. For example, let G=(V,E) be a graph and let w(e)>0 be given positive real numbers associated with every edge e in E.
