אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

In-network caching promises to improve the performance of distributed and networked applications. This is by storing so-called hot items in the network switches on-route between clients who need access to the data and the storage servers who maintain it. Since the data flows through those ...
[לנוסח המלא]

Blending and filleting are well established operations in solid modeling and computer-aided geometric design. The creation of a transition surface which smoothly connects the boundary surfaces of two (or more) objects has been extensively investigated. In this talk, we will introduce several algorithms for the ...
[לנוסח המלא]

Speculative execution attacks present an enormous security threat, capable of reading arbitrary program data under malicious speculation and later exfiltrating that data over microarchitectural covert channels. This talk will describe a comprehensive hardware protection from speculative execution attacks. We will first describe Speculative Taint Tracking ...
[לנוסח המלא]

Engineering design is a task that comes with high responsibility: A failed design may easily cause not only monetary damage but, even more importantly, injuries of users. Based on a collection of design flaws [Petroski1994], this presentation will give an overview over modern design approaches ...
[לנוסח המלא]

Hyperproperties lift conventional trace properties in a way that describes how a system behaves in its entirety, and not just based on its individual traces. We generalize this notion to multi-properties, which describe the behavior of a set of systems, called a multi-model. We show ...
[לנוסח המלא]

Offchain networks are dominant as a solution to the scalability problem of blockchain systems, allowing users to perform payments without their recording on the chain by relying on predefined payment channels. Users together with the offchain channels form a graph, known as the offchain network ...
[לנוסח המלא]

Most AI research focuses exclusively on the AI agent itself, i.e., given some input, what are the improvements to the agent’s reasoning that will yield the best possible output? In my research, I take a novel approach to increasing the capabilities of AI agents via ...
[לנוסח המלא]

We present a new approach to the acceleration of geometric algorithms for freeform surfaces using a hierarchy of bounding volumes, including those based on the osculating toroidal patches to the surfaces. Using this approach, we revisit some non-trivial conventional geometric algorithms, including those for computing ...
[לנוסח המלא]

In this talk i'll be covering several works in the topic of 3D deep learning on pointclouds for scene understanding tasks. First, I'll describe VoteNet (ICCV 2019, best paper nomination): a method for object detection from 3D pointclouds input, inspired by the classical generalized Hough ...
[לנוסח המלא]

Sketches maintain compact approximate statistics about streams of data, thereby enabling quickly answering queries regarding the data stream without having to reprocess it. In this talk we will present four different papers that studies concurrent sketches and their applications. In particular we looked at these ...
[לנוסח המלא]

Quotient spaces are a natural mathematical tool to describe a variety of algorithmic problems where different objects are to be compared while their natural symmetries are to be ignored. In particular, we will focus on graphs and sets whose symmetries are permutation of the vertices, ...
[לנוסח המלא]

We discretize mappings between surfaces as correspondences between checkerboard patterns derived from quad meshes. This method captures the degrees of freedom inherent in smooth maps and provides a very simple and efficient computational approach to important types of maps such as conformal or isometric maps. ...
[לנוסח המלא]

A streaming algorithm is given a long sequence of items and seeks to compute or approximate some function of this sequence using a small amount of memory. A body of work has been developed over the last two decades, resulting in optimal streaming algorithms for ...
[לנוסח המלא]

There is a growing number of tasks that work directly on point clouds. As the size of the point cloud grows, so do the computational demands of these tasks. A possible solution is to sample the point cloud first. Classic sampling approaches, such as farthest ...
[לנוסח המלא]

Program synthesis is the problem of generating a program to satisfy a specification of user intent. Since these specifications are usually partial, this means searching a space of candidate programs for one that exhibits the desired behavior. The lion's share of the work on program ...
[לנוסח המלא]

My primary goal in this fringe direction of research is to develop a simple, intuitive formal framework for the automatic representation of simplified shapes and materials that can support Hyper-Realism in a wide variety of rendering applications. I observe that with the emphasis on the ...
[לנוסח המלא]