CS Department Events and Talks
Principles of Reasoning with Graphical Models
- Speaker:
- Rina Dechter
- Date:
- Tuesday, 19.6.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
ceClub: Improved Bounds for Byzantine Self-Stabilizing Clock Synchronization
The challenging task of Byzantine self-stabilizing pulse synchronization requires that, in the presence of a minority of nodes that are permanently maliciously faulty, the ...
- Speaker:
- Christoph Lenzen (Weizmann Institue of Science)
- Date:
- Wednesday, 13.6.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
The surprises of Quick Sort
- Speaker:
- Micha Hofri
- Date:
- Tuesday, 5.6.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
CGGC Seminar: On the possibility of simple parallel computing of Voronoi diagrams and Delaunay Graphs
Although many algorithms for computing Euclidean Voronoi diagrams of point sites have been published, most of them are sequential in nature and hence cast ...
- Speaker:
- Daniel Reem (IMPA, Rio, Brasil)
- Date:
- Sunday, 3.6.2012, 13:00
- Place:
- Room 337-8 Taub Bld.
Safe Zones: An Efficient Approach to Distributed Monitoring
Many monitoring tasks over distributed data streams can be formulated as a continuous query using a function that is defined over the global average ...
- Speaker:
- Amir Abboud
- Date:
- Wednesday, 30.5.2012, 16:30
- Place:
- Taub 601
Coverage-Driven Refinement of Conceptual Representations
Many text processing tasks are based on estimating semantic relatedness between texts. For example, in information retrieval, relevancy of documents can be determined based ...
- Speaker:
- Haggai Toledano
- Date:
- Wednesday, 30.5.2012, 13:30
- Place:
- Taub 601
Theory Seminar: From Irreducible Representations to Locally Decodable Codes
- Speaker:
- Ofer Neiman (Ben-Gurion University)
- Date:
- Wednesday, 30.5.2012, 12:30
- Place:
- Taub 201
Computing in the 21st Century: The Georgia Tech Model
- Speaker:
- Zvi Galil
- Date:
- Tuesday, 29.5.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Theory Seminar: Optimal Testing of Multivariate Polynomials over Small Prime Field
We consider the problem of testing if a given function f is close to a n-variate degree d polynomial over the finite field of ...
- Speaker:
- Elad Haramaty ( (CS, Technion)
- Date:
- Wednesday, 23.5.2012, 12:30
- Place:
- Taub 201
ceClub: Dr. Philip M. Merlin Memorial Lecture and Prize Award: Scheduling Algorithms for the 4G Cellular Networks
Cellular networks are becoming more and more crucial to our daily lives and operators are seeking new technologies for increasing their bandwidth. Examples for ...
- Speaker:
- Reuven Cohen (CS, Technion)
- Date:
- Wednesday, 23.5.2012, 11:30
- Place:
- EE Meyer Building 1003
The Complexity of Cryptography
- Speaker:
- Yuval Ishai
- Date:
- Tuesday, 22.5.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Human Attributes from 3D Pose Tracking
This talk concerns the estimation of human attributes from 3D human pose and motion. We consider both physical attributes (eg, gender and weight) and ...
- Speaker:
- Micha Livne (CS, University of Toronto)
- Date:
- Tuesday, 22.5.2012, 11:30
- Place:
- EE Meyer Building 1061
Theory Seminar: Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
Let F be the field of q elements, where q=p^l for prime p. Informally speaking, a polynomial source is a distribution over F^n sampled ...
- Speaker:
- Ariel Gabizon (CS. Technion)
- Date:
- Wednesday, 16.5.2012, 12:30
- Place:
- Taub 201
ceClub:Dynamic Reconfiguration of Primary/Backup Clusters
Dynamically changing (reconfiguring) the membership of a replicated distributed system while preserving data consistency and system availability is a challenging problem. In this talk ...
- Speaker:
- Alex Shraer (Yahoo! Research)
- Date:
- Wednesday, 16.5.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Haifux Club: InfiniBand, RoCE and RDMA Verbs - Empowering Supercomputing and Data Center Interconnects
This lecture aims to provide a brief introduction to the InfiniBand™ architecture and programming using RDMA verbs. InfiniBand is an open standard, used in ...
- Speaker:
- Dotan Barak (Mellanox)
- Date:
- Monday, 14.5.2012, 18:30
- Place:
- Taub 3
Theory Seminar: Fully Dynamic Approximate Distance Oracles for Planar Graphs via Forbidden-Set Distance Labels
Distance oracle is a data structure that provides fast answers to distance queries. Recently, the problem of designing distance oracles capable of answering restricted ...
- Speaker:
- Shiri Chechik (Weizmann Institute of Science)
- Date:
- Wednesday, 9.5.2012, 12:30
- Place:
- Taub 201
ceClub: Self-Adjusting Networks and Distributed Data Structures
We study self-optimizing networks and data structures. The goal of this research line is the design of fully distributed algorithms which flexibly adapt the ...
- Speaker:
- Chen Avin (Ben Gurion University)
- Date:
- Wednesday, 9.5.2012, 11:30
- Place:
- EE Meyer Building 861
Functions which are close to being k-local are juntas
- Speaker:
- Guy Kindler
- Date:
- Tuesday, 8.5.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Viewpoint-Aware Object Detection and Pose Estimation
We describe an approach to category-level detection and viewpoint estimation for rigid 3D objects from single 2D images. In contrast to many existing methods, ...
- Speaker:
- Daniel Glazner (Faculty of Mathematics and Computer Science The Weizmann Institute of Science)
- Date:
- Tuesday, 8.5.2012, 11:30
- Place:
- EE Meyer Building 1061
Haifux Club: Scientific Python
See Hebrew announcement.
- Speaker:
- Uri Barkan
- Date:
- Monday, 7.5.2012, 18:30
- Place:
- Taub 3
Theory Seminar: Random Arithmetic Formulas can be Reconstructed Efficiently
What is an optimal formula computing a given multivariate polynomial $f$? In this work, we show that this question admits an efficient algorithmic solution ...
- Speaker:
- Ankit Gupta (CS, Technion)
- Date:
- Wednesday, 2.5.2012, 12:30
- Place:
- Taub 201
How Do Classes Choose Their Parents? (Preferential Attachment to the Trial)
- Speaker:
- Yossi Gil
- Date:
- Tuesday, 1.5.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Learning Feature Descriptors
SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition, photo-tourism, and 3D ...
- Speaker:
- Alex Bronstein (School of Electrical Engineering, Tel Aviv University)
- Date:
- Tuesday, 1.5.2012, 11:30
- Place:
- EE Meyer Building 1061
Extracting Meaning from Search Behavior Data
- Speaker:
- Eugene Agichtein
- Date:
- Tuesday, 24.4.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Haifux Club: Modern Web Development in Perl
Back in the early years of the dynamic web, Perl was the de-facto choice of language. It was so ubique that people associated it ...
- Speaker:
- Gabor Szabo
- Date:
- Monday, 23.4.2012, 18:30
- Place:
- Taub 3
Concurrent Wait-Free Data-Structrues
Lock-free data-structures guarantee overall system progress, whereas wait-free data-structures guarantee the progress of each and every thread, providing the desirable non-starvation guarantee. While efficient ...
- Speaker:
- Shahar Timnat
- Date:
- Monday, 23.4.2012, 14:00
- Place:
- Taub 701
Theory Seminar: Pseudorandom Generators with Large Stretch and Low Locality from Random Local One-Way Functions
Locally-computable pseudorandom generators (PRGs) map n random input bits into m>n pseudorandom bits such that each of the m outputs depend on a small ...
- Speaker:
- Benny Applebaum, Tel-Aviv University
- Date:
- Sunday, 22.4.2012, 13:00
- Place:
- Taub 201
CGGC Seminar: Towards Unencumbered 3D Teleconferencing Systems
With the recent development of auto-multiscopic 3D displays that provide a 3D experience without the use of glasses, and with the recent availability of ...
- Speaker:
- Tiberiu Popa (Computer Graphics Laboratory , ETH, Zurich)
- Date:
- Thursday, 19.4.2012, 11:15
- Place:
- Room 337-8 Taub Bld.
ceClub and TCE Lecture: Green Cellular Networks: A Survey, Some Research Issues and Challenges
In this talk, we present techniques to enable green communications in future generation of wireless systems that will rely on cooperation and cognition to ...
- Speaker:
- Vijay K. Bhargava (University of British Columbia and President, IEEE Communications Society)
- Date:
- Wednesday, 18.4.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Improved Competitive Ratio for the Matroid Secretary Problem
- Speaker:
- Oded Lachish
- Date:
- Tuesday, 17.4.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Adaptive Reconstruction Methods for Low-Dose Computed Tomography
The main problem with contemporary Computed Tomography (CT) imaging is the high radiation dose absorbed by patients during the screening. Reducing this dose may ...
- Speaker:
- Yossi Shtok
- Date:
- Thursday, 5.4.2012, 11:30
- Place:
- Taub 337
Resource Management in Grid Environments
Grid computing environments have become mission-critical components in research and industry, offering sophisticated solutions to exploit large computing and storage resources across multiple geographic ...
- Speaker:
- Pavel Bar
- Date:
- Wednesday, 4.4.2012, 14:00
- Place:
- Taub 601
Algebraic Collocation Coarse Approximation (ACCA) in Multigrid
Most algebraic multigrid (AMG) methods define the coarse operators by applying the (Petrov-) Galerkin coarse approximation (GCA) where the sparsity pattern and operator complexity ...
- Speaker:
- Ran Zemach
- Date:
- Wednesday, 4.4.2012, 12:30
- Place:
- Taub 601
Labelings and Partitions of Graphs
The study of combinatorial problems with a submodular objective function has attracted much attention in recent years, and is partly motivated by the importance ...
- Speaker:
- Roy Schwartz
- Date:
- Wednesday, 4.4.2012, 12:30
- Place:
- Taub 201
Theory Seminar: Labelings and Partitions of Graphs
The study of combinatorial problems with a submodular objective function has attracted much attention in recent years, and is partly motivated by the importance ...
- Speaker:
- Roy Schwartz (CS, Technion)
- Date:
- Wednesday, 4.4.2012, 12:30
- Place:
- Taub 201
Determining the Winner of a Dodgson Election is Hard
- Speaker:
- Professor Frances Rosamond
- Date:
- Tuesday, 3.4.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Bioinformatics Forum: Biomed Data at Work
Access to high-quality data drives our ability to ask questions and find answers. Our lab has a number of projects based on this premise. ...
- Speaker:
- Eugene Kolker (Children's Hospital, University of Washington)
- Date:
- Tuesday, 3.4.2012, 13:30
- Place:
- Shelter seminar room, Biology, Technion
Pixel Club: Generalized Projection Based M-estimator
A new robust estimation algorithm, the generalized projection based M-estimator (gpbM) is proposed. The algorithm is general and can handle heteroscedastic data where every ...
- Speaker:
- Peter Meer (Electrical and Computer Engineering Department Rutgers University)
- Date:
- Tuesday, 3.4.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Haifux Club: Automatic Parallelization in GCC
With the emergence of multicore architectures there is a growing need for automatic parallelization, that distributes sequential code into multi threaded code. OpenMP defines ...
- Speaker:
- Razya Ladelsky (IBM R&D, Haifa)
- Date:
- Monday, 2.4.2012, 18:30
- Place:
- Taub 3
The algorithmization of causes and counterfactuals
- Speaker:
- Judea Pearl, Special Guest Talk, Harvey Prize and Turing Award Winner,
- Date:
- Thursday, 29.3.2012, 11:00
- Place:
- Room Auditorium 2 Taub Bld.
Cache or Charge? Cooperative Caching with Credits
In cooperative storage caching, clients may access blocks directly from each other's caches. Previous studies treated all the cooperating caches as a single pool, ...
- Speaker:
- Gala Yadgar
- Date:
- Wednesday, 28.3.2012, 12:30
- Place:
- Taub 601
Theory Seminar: On the complexity of the Furthest Hyperplane Problem
This paper introduces the Furthest Hyperplane Problem (FHP), which is an unsupervised counterpart of Support Vector Machines. Given a set of n points in ...
- Speaker:
- Zohar Karnin (Yahoo! Research)
- Date:
- Wednesday, 28.3.2012, 12:30
- Place:
- Taub 201
ceClub: Improving Virtualization Performance Through Phy
Machine virtualization, where many virtual machines run on a single physical machine, has become an increasingly popular area of research and development in the ...
- Speaker:
- Nadav Amit (CS, Tehcnion)
- Date:
- Wednesday, 28.3.2012, 11:30
- Place:
- Taub 401
Parameterizing on the Number of Numbers
- Speaker:
- Prof. Michael Fellows
- Date:
- Tuesday, 27.3.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
TCE Lecture: Consistent Hashing, Danny Lewin, and the Creation of Akamai
In 1996, twelve years after making Aliyah to Israel, Danny Lewin graduated from the Technion and came to MIT to study algorithms. Over the ...
- Speaker:
- Tom Leighton (Applied Math, MIT)
- Date:
- Tuesday, 27.3.2012, 11:00
- Place:
- Butler Auditorium, Mosad Neeman Building,Technion
e-club: How to Start a Start-Up
Have you always dreamed to start a Start-up and didn't know how? Come to meet, hear and ask those who made it big time!
- Speaker:
- Ofer Vilenski (Jungo)
- Date:
- Monday, 26.3.2012, 18:30
- Place:
- Taub 337
CSpecial Talk: Unified Algorithms for Online Learning and Competitive Analysis
Online learning and competitive analysis are two widely studied frameworks for online decision-making settings. Despite the frequent similarity of the problems they study, there ...
- Speaker:
- Shahar Chen (CS, Tehcnion)
- Date:
- Sunday, 25.3.2012, 16:30
- Place:
- Taub 601
Approximating Semidefinite Programs In Sublinear Time
Semidefinite programming is a fundamental problem in convex programming with numerous applications. In the field of combinatorial optimization, many approximation algorithms that rely on ...
- Speaker:
- Dan Garber
- Date:
- Wednesday, 21.3.2012, 16:00
- Place:
- Taub 701
Automatic Extraction of Subcategorization Frames for Hebrew
Verb subcategorization frames determine the number and types of the syntactic arguments that verbs select, or subcategorize for. Typically, verbs can be associated with ...
- Speaker:
- Hanna Fadida
- Date:
- Wednesday, 21.3.2012, 14:30
- Place:
- Taub 701
Bioinformatics Forum: Global sampling of Macromolecular Association Energy landscapes using Fast Fourier Transforms and their Generalizations
Sampling energy landscape of macromolecular interactions is a challenging problem of computational biology. Classical approaches like Molecular Dynamics and Monte Carlo are not always ...
- Speaker:
- Dima Kozakov (Biomedical Engineering, Boston University)
- Date:
- Wednesday, 21.3.2012, 13:00
- Place:
- Seminar room, 4th floor, Emerson building, Technion
Theory Seminar: Title: Monotone Unification Problems
Given two monotone polynomials f,g, their unifier is a pair of monotone polynomials u,v such that f=cu+v and g=u+cv, for some c>0. The problem ...
- Speaker:
- Pavel Hrubes Princeton University)
- Date:
- Wednesday, 21.3.2012, 12:30
- Place:
- Taub 201
Pixel Club: Not Your Typical Pixel: On "Cortical Vision" without Visual Cortex
Our visual attention is attracted by salient stimuli in our environment and affected by primitive features such as orientation, color, and motion. Perceptual saliency ...
- Speaker:
- Ohad Ben-Shahar (Ben-Gurion University)
- Date:
- Tuesday, 20.3.2012, 11:30
- Place:
- EE Meyer Building 1061
Haifux Club: Software Tools for Reconfigurable Architectures
Reconfigurable computing allows a lower power consumption to achieve higher performance than software, while maintaining a higher level of flexibility than hardware. Reconfigurable devices, ...
- Speaker:
- Victor Kaplansky (IBM R&D, Haifa)
- Date:
- Monday, 19.3.2012, 18:30
- Place:
- Taub 6
ceClub: PCI Express: Technology, Road Map and Design Challenges
PCI Express is an industry standard, and the most prominent interconnection architecture for I/O devices and other boards inside a computer. It is defined ...
- Speaker:
- Rick Eads (Agilent Technologies)
- Date:
- Monday, 19.3.2012, 15:30
- Place:
- EE Meyer Building 861
Pixel Club: Geometric constraints in shape analysis
Traditional models of bendable surfaces are based on the exact or approximate invariance to deformations that do not tear or stretch the shape, leaving ...
- Speaker:
- Dan Raviv (CS, Tehcnion)
- Date:
- Monday, 19.3.2012, 10:30
- Place:
- Room 337-8 Taub Bld.
Quantum Neural Computation and Associative Memory
This thesis presents quantum analogues of artificial neural networks. We analyze and compare their performance to known classical and previously proposed quantum models. First ...
- Speaker:
- Tamer Salman
- Date:
- Wednesday, 14.3.2012, 16:30
- Place:
- Taub 701
A Study of Data Structures with a Deep Heap Shape
Computing environments become increasingly parallel, and it seems likely that we will see more cores on tomorrow's desktops and server platforms. In a highly ...
- Speaker:
- Haggai Eran
- Date:
- Wednesday, 14.3.2012, 15:00
- Place:
- Taub 701
Finding Malware on a Web Scale
- Speaker:
- Ben Livshits SPECIAL GUEST LECTURE,
- Date:
- Wednesday, 14.3.2012, 14:30
- Place:
- Room 539 Taub Bld.
Violation Resolution in Distributed Stream Networks
Threshold monitoring applications in distributed stream networks contin- uously monitor the global score of the network and alert whenever a given threshold is crossed. ...
- Speaker:
- David Ben-David
- Date:
- Wednesday, 14.3.2012, 13:00
- Place:
- Taub 701
Theory Seminar: Causality, Knowledge and Coordination in Synchronous Systems
Coordinating the proper ordering of events across remote sites is a central task of distributed applications. In asynchronous systems, such coordination depends in an ...
- Speaker:
- Ido Ben-Zvi (EE, Technion)
- Date:
- Wednesday, 14.3.2012, 12:30
- Place:
- Taub 201
Bioinformatics Forum: Systems Biology of Viral Pathogenesis and Immunity: Where are Google and IBM?
After decades of research, vaccines against some of the greatest viral threats are still lacking and antiviral drugs remain few and slow in coming. ...
- Speaker:
- Michael G. Katze (University of Washington, Seattle)
- Date:
- Wednesday, 14.3.2012, 11:30
- Place:
- Taub 401
TCE Special Guest Lecture: Obstacles and Chances for Multi-core Deployment in Hard Real-time Systems
Providing higher performance than state-of-the-art embedded processors can deliver today will increase safety, comfort, number and quality of services, while also lowering emissions as ...
- Speaker:
- Prof. Theo Ungerer (CS, University of Augsberg, Germany)
- Date:
- Tuesday, 13.3.2012, 14:30
- Place:
- EE Meyer Building 861
NUMA and locality aware multi-core software
Emerging computer architectures pose many new challenges for software development. First, as the number of computing elements constantly increases, the importance of scalability of ...
- Speaker:
- Elad Gidron
- Date:
- Monday, 12.3.2012, 14:00
- Place:
- Taub 701
Learning Linear Support Vector Machines in Sublinear Time
In recent years, stochastic approximation approaches such as Stochastic Gradient Descent (SGD) and Stochastic Dual Averaging have become the optimization method of choice for ...
- Speaker:
- Tomer Koren
- Date:
- Wednesday, 7.3.2012, 14:30
- Place:
- Taub 701
Approximation Algorithm for Soft-Capacitated Connected Facility
Data centers are becoming the hosting platform for a wide spectrum of composite applications. In recent years, large investments have been made in massive ...
- Speaker:
- Assaf Rappaport
- Date:
- Tuesday, 6.3.2012, 14:00
- Place:
- Taub 601
Matrix Learning: A Tale of Two Norms
- Speaker:
- Nati Srebro
- Date:
- Wednesday, 29.2.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Polar codes: construction and improved decoding
- Speaker:
- Ido Tal
- Date:
- Tuesday, 28.2.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Hierarchical Invariant Sparse Modeling for Image Analysis
Sparse representation theory has been increasingly used in signal processing and machine learning. In this work we introduce a hierarchical sparse modeling approach which ...
- Speaker:
- Leah Bar (Mathematics, Tel Aviv University)
- Date:
- Tuesday, 21.2.2012, 11:30
- Place:
- EE Meyer Building 1061
Haifux Club: Making Hebrew Slides with LaTeX and Beamer
LaTeX is a high-quality typesetting system; BEAMER is is a LaTeX class for creating presentations; Hebrew is an esoteric west Semitic language we happen ...
- Speaker:
- Gai Shaked
- Date:
- Monday, 20.2.2012, 18:30
- Place:
- Taub 6
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters
We deal with the Regenerator Location Problem in optical networks. We are given a network G = (V, E), and a set Q of ...
- Speaker:
- Itamar Hartstein
- Date:
- Sunday, 19.2.2012, 11:30
- Place:
- Taub 701
Synthesizing Concurrent Relational Data Structures
- Speaker:
- Roman Manevich
- Date:
- Tuesday, 14.2.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Geometric Methods for Analyzing and Monitoring Large Distributed Data
A basic requirement in many distributed systems is the ability to detect objects whose score, according to a given function, exceeds some threshold. Since ...
- Speaker:
- Guy Sagy
- Date:
- Wednesday, 8.2.2012, 13:00
- Place:
- Taub 601
ceClub: Synthesizing Concurrent Relational Data Structures
Efficient concurrent data structures are extremely important for obtaining good performance for most parallel programs. However, ensuring the correctness of concurrent data structure implementations ...
- Speaker:
- Roman Manevich (UT Austin)
- Date:
- Wednesday, 8.2.2012, 11:30
- Place:
- EE Meyer Building 861
Multiparty Computation from Somewhat Homomorphic Encryption
- Speaker:
- Ivan Damgaard
- Date:
- Tuesday, 7.2.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Tissue Microenvironment Magnetic Resonance Imaging (TM-MRI) of the body: A Reliable Quantitative Biomarker for Personalized Treatment Paradigms
Personalized treatment approaches which optimize drugs doses according to pre-treatment and early response-to-therapy evaluation hold the promise to improve treatment success rates and reduce ...
- Speaker:
- Moti Freiman (Computational Radiology Lab, Harvard Medical School)
- Date:
- Tuesday, 7.2.2012, 11:30
- Place:
- EE Meyer Building 1061
Haifux Club: C++ AMP: Microsoft approach for Heterogeneous Computing
C++ AMP (Accelerated Massive Parallelism) is a native programming model that contains elements that span the C++ programming language and its runtime library. The ...
- Speaker:
- Avi Mendelson (Microsoft and CS&EE, Technion)
- Date:
- Monday, 6.2.2012, 18:30
- Place:
- Taub 6
Random Sampling Preconditioners
- Speaker:
- Haim Avron SPECIAL GUEST TALK-
- Date:
- Monday, 6.2.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Utilizing Multiple Radio Interfaces in Wireless Networks
Contemporary mobile devices are equipped with multiple wireless interfaces, such as WiFi, Bluetooth, WiMax, ZigBee, NFC, etc. All these technologies differ dramatically one from ...
- Speaker:
- Alex Kogan
- Date:
- Wednesday, 1.2.2012, 11:00
- Place:
- Taub 601
The Plural Architecture: Shared Memory Many-cores with Hardware Scheduling
- Speaker:
- Ran Ginosar
- Date:
- Tuesday, 31.1.2012, 15:30
- Place:
- Room 337-8 Taub Bld.
How Your Smartphone Can Use Game-Theory to Valet-park Your Car
- Speaker:
- Ouri Wolfson
- Date:
- Tuesday, 31.1.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Diverse M-best Solutions in MRFs
Much effort has been directed at algorithms for obtaining the highest probability (MAP) configuration in a probabilistic (random field) model. In many situations, one ...
- Speaker:
- Greg Shakhnarovich (TTI-Chicago)
- Date:
- Tuesday, 31.1.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Exploiting Morphology in Identifying Multiword Expressions from Multilingual Parallel Corpora
Our research discusses multi-word expressions (MWE) such as "kick the bucket", "hot dog", "by and large", "look up, and "spill the beans". Identification of ...
- Speaker:
- Daniel Hurwitz
- Date:
- Wednesday, 25.1.2012, 12:30
- Place:
- Taub 601
Theory Seminar: Coin Flipping with Constant Bias Implies One-Way Functions
It is well known (c.f., Impagliazzo and Luby [FOCS '89]) that the existence of almost all ``interesting" cryptographic applications, i,e., ones that cannot hold ...
- Speaker:
- Eran Omri (Bar-Ilan University)
- Date:
- Wednesday, 25.1.2012, 12:30
- Place:
- Taub 201
Pixel Club: Visual Audio Denoising
Audio denoising is a long studied problem, with numerous algorithms and a wide accumulated knowledge. Considering non-stationary noise (like noise in a cocktail party ...
- Speaker:
- Dana Segev (EE, Technion)
- Date:
- Tuesday, 24.1.2012, 11:30
- Place:
- EE Meyer Building 1061
Theory Seminar: A Polylogarithmic-Competitive Algorithm for the $k$-Server Problem
The $k$-server problem is one of the most fundamental and extensively studied problems in online computation. Suppose there is an $n$-point metric space and ...
- Speaker:
- Niv Buchbinder (Open University )
- Date:
- Wednesday, 18.1.2012, 12:30
- Place:
- Taub 201
ceClub: Distributed Average Consensus and Coherence in Dynamic Networks
In the distributed average consensus problem, each node in a network has an initial value, and the objective is for all nodes to reach ...
- Speaker:
- Stacy Patterson (EE, Technion)
- Date:
- Wednesday, 18.1.2012, 11:30
- Place:
- EE Meyer Building 861
Vector Diffusion Maps and the Connection Laplacian
- Speaker:
- Amit Singer
- Date:
- Tuesday, 17.1.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: The Role of Target Fixations in the Process of Recognition
Why do we perceive some elements in a visual scene, while others remain undetected? We compared fixations on detected vs. undetected items in the ...
- Speaker:
- Michal Jacob (Intel, Computer Vision Group)
- Date:
- Tuesday, 17.1.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Definability of Combinatorial Functions
The complexity of several prominent graph polynomials, such as the chromatic polynomial and the matching polynomial, has been studied in the literature. In 2008 ...
- Speaker:
- Tommer Kotek
- Date:
- Wednesday, 11.1.2012, 14:30
- Place:
- Taub 601
Making Computers Good Listeners
- Speaker:
- Joseph Keshet
- Date:
- Wednesday, 11.1.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Theory Seminar: Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
I will present a new approach for creating chosen ciphertext secure encryption. The focal point of our work is a new abstraction that we ...
- Speaker:
- Brent Waters (University of Texas)
- Date:
- Wednesday, 11.1.2012, 12:30
- Place:
- Taub 201
ceClub: Persistent OSPF Attacks
Open Shortest Path First (OSPF) is the most popular interior gateway routing protocol on the Internet. Most known OSPF attacks that have been published ...
- Speaker:
- Gabi Nakibly (National EW Research and Simulation Center)
- Date:
- Wednesday, 11.1.2012, 11:30
- Place:
- Taub 337
Missing Heritability: New algorithmic and statistical approaches
- Speaker:
- Or Zuk
- Date:
- Tuesday, 10.1.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Pose Estimation and Recognition using Specular Highlights
We presents a novel approach to pose estimation and model-based recognition of specular objects in difficult viewing conditions, such as low illumination, cluttered background, ...
- Speaker:
- Margarita Osadchy (CS, Haifa University)
- Date:
- Tuesday, 10.1.2012, 11:30
- Place:
- EE Meyer Building 1061
Haifux Club: Maqaf Hataf Patakh - The new standard Hebrew Keyboard Layout
In the last two years a committee in the Standards Institution of Israel worked, on my initiative and with my active participation, on a ...
- Speaker:
- Amir E. Aharoni
- Date:
- Monday, 9.1.2012, 18:30
- Place:
- Taub 6
Efficient and Exact Inter-Sentence Decoding for Natural Language Processing
- Speaker:
- Roi Reichart
- Date:
- Monday, 9.1.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Fast Distributed Computing Despite Poor Connectivity
- Speaker:
- Keren Censor-Hillel
- Date:
- Sunday, 8.1.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Theory Seminar: Subspace Evasive Sets
We describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional ...
- Speaker:
- Zeev Dvir (Princeton University)
- Date:
- Thursday, 5.1.2012, 12:30
- Place:
- Taub 601
Algorithmic cooling of spins using optimal control
Nuclear magnetic resonance (NMR) has proven to be a leading implementation of quantum information processors where each molecule in the sample constitutes a register ...
- Speaker:
- Yossi Attiya
- Date:
- Wednesday, 4.1.2012, 13:30
- Place:
- Taub 601
Theory Seminar: Homomorphic Encryption: from Private-Key to Public-Key
We show how to transform any additively homomorphic private-key encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that ...
- Speaker:
- Ron Rothblum (Weizmann Institute for Science)
- Date:
- Wednesday, 4.1.2012, 12:30
- Place:
- Taub 337
ceClub: Graph Matching and Clustering on the GPU
Graph matching is the problem of matching nodes of a graph in pairs such that the largest number of pairs is created or the ...
- Speaker:
- Rob Bisseling (Utrecht University)
- Date:
- Wednesday, 4.1.2012, 11:30
- Place:
- Taub 9
The complexity of counting constraint satisfaction problem
- Speaker:
- Andrei Bulatov
- Date:
- Tuesday, 3.1.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
ceClub: Load Balancing for SIP Server Clusters
The Session Initiation Protocol (SIP) is widely used for controlling communication sessions such as voice and video calls over IP, video conferencing, streaming multimedia ...
- Speaker:
- Erich Nahum (IBM T.J. Watson Research Center)
- Date:
- Tuesday, 3.1.2012, 12:45
- Place:
- Taub 337
Pixel Club: Contour-Based Joint Clustering of Multiple Segmentations
We present an unsupervised, shape-based method for joint clustering of multiple image segmentations. Given two or more closely-related images, such as close frames in ...
- Speaker:
- Daniel Glasner (Math & CS, The Weizmann Institute of Science)
- Date:
- Tuesday, 3.1.2012, 11:30
- Place:
- EE Meyer Building 1061
Haifux Club: GPGPU - Case studies, Do's and Dont's (Part 4 out of 4 talks series)
This is a 4 series of 4 talks about GPGPUS, intended for the practical engineer: 1. Motivation, AMD's architecture 2. OpenCL 3.Case studies, Dos ...
- Speaker:
- Ofer Rosenberg and Yaki Tebeka (AMD)
- Date:
- Monday, 2.1.2012, 18:30
- Place:
- Taub 337
Semantic Model Differencing for Software Evolution
- Speaker:
- Shahar Maoz
- Date:
- Sunday, 1.1.2012, 14:30
- Place:
- Room 337-8 Taub Bld.