CS Department Events and Talks
CGGC Seminar: Hierarchical Volumetric Modeling as a Base for Multiscale Physical Based Analysis and Design of Porous Structures
Hierarchical modeling is often applied in fields such as computer vision, computer graphics, computer-aided geometric design, cartography and virtual reality. The importance of this ...
- Speaker:
- Lev Podshivalov (Pierre-and-Marie-Curie University, Paris, France)
- Date:
- Sunday, 30.12.2012, 13:00
- Place:
- Room 337-8 Taub Bld.
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
A Probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the ...
- Speaker:
- Mor Weiss
- Date:
- Thursday, 27.12.2012, 15:00
- Place:
- Taub 701
Theory Seminar: Distributed Computing Meets Biology: Towards a New Scientific Framework
In recent years, several works have demonstrated how the study of biology can benefit from an algorithmic perspective. In this talk I discuss a ...
- Speaker:
- Amos Korman (University of Paris Diderot)
- Date:
- Wednesday, 26.12.2012, 12:30
- Place:
- Taub 201
TCE Guest Lecture: Energy-Aware Scheduling for Heterogeneous Multi-Core Architectures
The current trend to move from homogeneous to heterogeneous multi-core (HetCMP) systems promises further performance and energy-efficiency benefits. A typical HetCMP system includes two ...
- Speaker:
- Prof. Daniel Mossé (University of Pittsburgh)
- Date:
- Wednesday, 26.12.2012, 11:30
- Place:
- EE Meyer Building 861
Pixel Club: From the invention of Compressive Sensing to Recent Results
Compressive sensing (CS), also known as compressive sampling, has become widely popular in recent years. In the first part of the talk, we review ...
- Speaker:
- Yoram Bresler (University of Illinois, Urbana-Champaign)
- Date:
- Tuesday, 25.12.2012, 13:30
- Place:
- EE Meyer Building 861
Pixel Club: Sparse Matrix Models for Finding Good Data Representatives and Constraining the Topology of Networks
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. ...
- Speaker:
- Guillermo Sapiro (Duke University)
- Date:
- Tuesday, 25.12.2012, 11:30
- Place:
- EE Meyer Building 1003
Haifux Club: Learning from the Open Source Production Process
The open source production process is fascinating in many respects: it produces high quality code outside the boundaries of the hierarchical organization, it defies ...
- Speaker:
- Yael Vaya-Talmor (Bar-Ilan University)
- Date:
- Monday, 24.12.2012, 18:30
- Place:
- Taub 6
Exploring Human Evolution and Deciphering the Human Genome Using Complete Individual Genome Sequences
- Speaker:
- Ilan Gronau
- Date:
- Monday, 24.12.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Generating Map-based Routes from GPS Trajectories and their Compact Representation
Digital maps and devices with an integrated GPS receiver, such as smartphones, are now an integral part of our lives. We deal with two ...
- Speaker:
- Ranit Gotsman
- Date:
- Wednesday, 19.12.2012, 13:00
- Place:
- Taub 601
Theory Seminar: New Applications of Communication Complexity in Distributed Computing
The advent of large-scale wireless networks has presented the distributed computing community with a new challenge: wireless networks are much more disorderly than traditional ...
- Speaker:
- Rotem Osman (University of Toronto)
- Date:
- Wednesday, 19.12.2012, 12:45
- Place:
- Taub 201
ceClub: Predicting Execution Bottlenecks in Map-Reduce Clusters
Extremely slow, or straggler, tasks are a major performance bottleneck in map-reduce systems. Hadoop infrastructure makes an effort to both avoid them (through minimizing ...
- Speaker:
- Edward Bortnikov (Yahoo! Labs Israel)
- Date:
- Wednesday, 19.12.2012, 11:30
- Place:
- EE Meyer Building 861
Operating system support for high-throughput processors
- Speaker:
- Mark Silberstein
- Date:
- Tuesday, 18.12.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Hybrid Classifiers for Object Classification with a Rich Background
The majority of current methods in object classification use the one-against-rest training scheme. We argue that when applied to a large number of classes, ...
- Speaker:
- Margarita Osadchy (Computer Science, Haifa University)
- Date:
- Tuesday, 18.12.2012, 11:30
- Place:
- EE Meyer Building 1061
TCE Guest Lecture: Multimodal First-Person Perception
For decades, our culture has been fascinated with the concept of the “Star Trek computer”. An all-knowing entity which is available to query about ...
- Speaker:
- Denver Dash (Intel – ISTC for Embedded Computing)
- Date:
- Thursday, 13.12.2012, 13:30
- Place:
- EE Meyer Building 1061
Fair is Fair: A Protocol and an Algorithm for Unbiased Evaluation of Linguistic Structure Prediction.
- Speaker:
- Reut Tsarfaty
- Date:
- Wednesday, 12.12.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Learning patterns in Big data from small data using core-sets
- Speaker:
- Dan Feldman
- Date:
- Tuesday, 11.12.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
TCE Guest Lecture: Unconventional Fault-tolerant Accelerators
Due to the evolution of technology constraints, especially energy constraints which may lead to heterogeneous multicores, and the increasing number of transient faults and ...
- Speaker:
- Prof. Olivier Temam (INRIA)
- Date:
- Thursday, 6.12.2012, 12:30
- Place:
- EE Meyer Building 861
Syntactic Annotation of Hebrew CHILDES Corpora
The CHILDES database is a large collection of child---adult spoken interactions in over 25 languages. Automatic annotation of these data faciliates research on child ...
- Speaker:
- Avishay Gretz
- Date:
- Wednesday, 5.12.2012, 12:30
- Place:
- Taub 601
Theory Seminar: Sealed Bid Combinatorial Auctions
We generalize sealed bid auctions to accommodate combinatorial auctions. In a sealed bid combinatorial auction each bidder sends to the auctioneer, simultaneously with the ...
- Speaker:
- Shahar Dobzinski (Weizmann Institute of Science)
- Date:
- Wednesday, 5.12.2012, 12:30
- Place:
- Taub 201
CGGC Seminar: Computing Extremal Quasiconformal Maps
Conformal maps are widely used in geometry processing applications. They are smooth, preserve angles, and are locally injective by construction. However, conformal maps do ...
- Speaker:
- Ofir Weber (Computer Science, Haifa University)
- Date:
- Wednesday, 5.12.2012, 11:30
- Place:
- Taub 401
Pixel Club: Photo Sequencing
Dynamic events such as family gatherings, concerts or sports events are often captured by a group of people. The set of still images obtained ...
- Speaker:
- Yael Moses (CS, The Interdisciplinary Center, Herzliya)
- Date:
- Tuesday, 4.12.2012, 11:30
- Place:
- EE Meyer Building 1061
Haifux Club: The Device Tree: Plug and play for Embedded Linux
On embedded systems, the Linux kernel doesn't have the BIOS to tell it what the hardware is like. On the other hand, the traditional ...
- Speaker:
- Eli Billauer
- Date:
- Monday, 3.12.2012, 18:30
- Place:
- Taub 6
TCE Guest Lecture: How Alan Turing Cracked the Enigma Code
Code breakers played an enormously crucial role in World War II. Alan Turing, the father of computer science, was at the center of allied ...
- Speaker:
- Prof. Ymir Vigfusson (Reykjavik University)
- Date:
- Monday, 3.12.2012, 13:30
- Place:
- Room 337-8 Taub Bld.
CGGC Seminar: Accelerating Geometric Operations on Freeform Models
NURBS is one of the typical way of representing geometric data and have been widely used in many areas such as computer graphics, CAGD, ...
- Speaker:
- Yong Joon Kim (Computer Science, Technion)
- Date:
- Sunday, 2.12.2012, 13:00
- Place:
- Room 337-8 Taub Bld.
Bioinformatics Forum: Fragment-Based Design of RNA sequences and Detection of RNA switches
The inverse RNA folding problem for designing sequences that fold into a given RNA secondary structure was introduced in the early 1990's in Vienna. ...
- Speaker:
- Danny Barash (CS, Ben-Gurion University)
- Date:
- Thursday, 29.11.2012, 13:30
- Place:
- Taub 701
Theory Seminar: Partially Symmetric Functions are Efficiently Isomorphism-Testable
Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up ...
- Speaker:
- Amit Weinstein (Tel-Aviv University)
- Date:
- Wednesday, 28.11.2012, 12:30
- Place:
- Taub 201
ceClub: Optimal Rebuilding in Distributed Storage Systems
Distributed storage systems have become a popular solution to large file storage and fast data access. In such systems, erasure-correcting codes are widely used ...
- Speaker:
- Zhiying Wang (Caltech)
- Date:
- Wednesday, 28.11.2012, 11:30
- Place:
- EE Meyer Building 861
Pixel Club: Extracting Foreground Masks towards Object Recognition
Effective segmentation prior to recognition has been shown to improve recognition performance. However, most segmentation algorithms adopt methods which are not explicitly linked to ...
- Speaker:
- Amir Rosenfeld (Weizmann Institute of Science)
- Date:
- Tuesday, 27.11.2012, 11:30
- Place:
- EE Meyer Building 1061
TCE Guest Lecture: Faults: a Foe or Friend?
The traditional performance-cost benefits enjoyed for decades from scaling of device area are challenged by the slowdown of voltage scaling and less reliable silicon ...
- Speaker:
- Prof. Yanos Sazeides (University of Cyprus)
- Date:
- Tuesday, 27.11.2012, 10:00
- Place:
- EE Meyer Building 1061
Fractional Secret Sharing and Lossy Chains
A rich man has many children. Unfortunately, over the years they have grew apart and started to hate each other. The rich man seeks ...
- Speaker:
- Omer Strulovich
- Date:
- Wednesday, 21.11.2012, 15:30
- Place:
- Taub 601
Joint Scheduling in Wireless Networks
A crucial step in the evolution of broadband wireless (cellular) networks is reducing the size of the cells and increasing their number. This target ...
- Speaker:
- Guy Grebla
- Date:
- Wednesday, 21.11.2012, 14:00
- Place:
- Taub 601
Theory Seminar: From the Impossibility of Obfuscation to a New Non-Black-Box Technique
The introduction of a non-black-box simulation technique by Barak (FOCS 2001) has been a major landmark in cryptography, breaking the previous barriers of black-box ...
- Speaker:
- Nir Bitansky (Tel-Aviv University)
- Date:
- Wednesday, 21.11.2012, 12:30
- Place:
- Taub 201
ceClub: CBTree: A Practical Concurrent Self-Adjusting Search Tree
We present the CBTree, a new counting-based self-adjusting sequential search tree that, like splay trees, moves more frequently accessed nodes closer to the root: ...
- Speaker:
- Adam Morrison (CS, Tel Aviv University)
- Date:
- Wednesday, 21.11.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Querying Web Applications Under Terms of Uncertainty
- Speaker:
- Daniel Deutch
- Date:
- Tuesday, 20.11.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Geometric Covering
Covering questions emerges in many disciplines and are closely related to the well known set-cover problem in computer science. Similarly, geometric covering is of ...
- Speaker:
- Nadav Shragai
- Date:
- Sunday, 18.11.2012, 13:00
- Place:
- Taub 337
Large Scale Semi-Supervised Sentiment Analysis
We describe a bootstrapping algorithm able to learn from partially labeled data. We report the results of an empirical study for using this algorithm ...
- Speaker:
- Yoav Haimovitch
- Date:
- Wednesday, 14.11.2012, 12:30
- Place:
- Taub 601
Theory Seminar: Predecessor Queries on Dynamic Subsets of an Ordered List, with Applications
In the famous order maintenance problem, one wishes to maintain a dynamic list L of size n under insertions, deletions, and order queries. In ...
- Speaker:
- Tsvi Kopelowitz (Weizmann Institute of Science)
- Date:
- Wednesday, 14.11.2012, 12:30
- Place:
- Taub 201
Backward causality in temporal Talmudic logic
- Speaker:
- Dov Gabbay
- Date:
- Tuesday, 13.11.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Non-Rigid Shape Correspondence Using Sparsity
Finding dense intrinsic correspondence between non-rigid shapes is a notoriously difficult problem with many important applications in computer graphics and pattern recognition. In the ...
- Speaker:
- Michael Bronstein (University of Lugano, Switzerland)
- Date:
- Tuesday, 13.11.2012, 11:30
- Place:
- EE Meyer Building 1003
Fast Parallel Matrix Multiplication
- Speaker:
- Oded Schwartz
- Date:
- Sunday, 11.11.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
On the Role of Color Information in Texture Recognition
Texture features have always been a key attribute in image recognition and classification. In this work we propose a pre-processing stage for enhancing the ...
- Speaker:
- Micha Kalfon
- Date:
- Sunday, 11.11.2012, 11:30
- Place:
- Taub 601
Taming Logics: Theory, Tools, Applications
- Speaker:
- Anna Zamansky
- Date:
- Wednesday, 7.11.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Asymptotic and Numerical Solution for Electrokinetic Flow Around a Spherical Particle
A numerical framework for the simulation of electrokinetic migration of particles in an electrolyte solution due to the application of an external electric field ...
- Speaker:
- Roman Zeyde
- Date:
- Wednesday, 7.11.2012, 12:30
- Place:
- Taub 601
Theory Seminar: On Sunflowers and Matrix Multiplication
In a distributed message passing model a communication network is represented by an n-vertex graph whose vertices host processors, and edges serve as communication ...
- Speaker:
- Leonid Barenboim (Ben-Gurion University)
- Date:
- Wednesday, 7.11.2012, 12:30
- Place:
- Taub 201
ceClub: The Future of the Telecommunication Industry: The New Horizon of Virtual Telecommunication and Carrier Clouds
Wireless networks are the most important assets in our industry, yet the problem is that we are building new networks the same way we ...
- Speaker:
- David Amzallag (Alcatel-Lucent)
- Date:
- Wednesday, 7.11.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
SSDL Seminar: On Incomplete Bug Fixes in Eclipse and Programmers Intuition on These
Recent studies indicate that multiple patches to software are found in a hefty portion of resolved bugs. It is also known that bugs that ...
- Speaker:
- Sabih Agbaria (CS, Technion)
- Date:
- Tuesday, 6.11.2012, 12:30
- Place:
- Taub 235
TCE Guest Lecture: Optimized Networked Systems
Optimal use of computing resources is pivotal to minimize expenditures and improve competitiveness of companies. The computing technologies are continuously evolving and the users ...
- Speaker:
- Prof. Ymir Vigfusson (Reykjavik University)
- Date:
- Monday, 5.11.2012, 13:30
- Place:
- EE Meyer Building 861
Pixel Club: Computational Reconstruction of Zebra-Fish Early Embryogenesis by Nonlinear Pde Methods of Image Processing
In the talk we present mathematical models and numerical methods which lead to early embryogenesis reconstruction and extraction of the cell lineage tree from ...
- Speaker:
- Prof. Karol Mikula (Department of Mathematics, Slovak University of Technology, Bratislava, Slovakia)
- Date:
- Thursday, 1.11.2012, 12:30
- Place:
- Room 337-8 Taub Bld.
Theory Seminar: Constructive Discrepancy Minimization by Walking on The Wedges
Minimizing the discrepancy of a set system is a fundamental problem in combinatorics. One of the cornerstones in this area is the celebrated six ...
- Speaker:
- Shachar Lovett (Institute for Advanced Study, Princeton)
- Date:
- Wednesday, 31.10.2012, 12:30
- Place:
- Taub 201
TOWARDS A PROOF THEORY OF ANALOGICAL REASONING
- Speaker:
- Matthias Baaz
- Date:
- Tuesday, 30.10.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
ceClub: Self-Optimizing Microprocessors: A Machine Learning Approach
As each technology generation brings additional transistors, the computer industry hopes to convert these into performance growth by stamping out a greater number of ...
- Speaker:
- Jose F. Martinez (Cornell University)
- Date:
- Tuesday, 30.10.2012, 13:30
- Place:
- EE Meyer Building 861
TCE Guest Lecture: Self-Optimizing Microprocessors: A Machine Learning Approach
As each technology generation brings additional transistors, the computer industry hopes to convert these into performance growth by stamping out a greater number of ...
- Speaker:
- Prof. José F. Martínez (Cornell University)
- Date:
- Tuesday, 30.10.2012, 13:30
- Place:
- EE Meyer Building 861
Haifux Club: Israeli Digital Rights NPO
The Digital Rights Movement stands between advanced technology and people rights (in the broad sense). Technological advance provides us with new products and new ...
- Speaker:
- Zvi Devir (digitalrights.org.il)
- Date:
- Monday, 29.10.2012, 18:30
- Place:
- Taub 6
Theory Seminar: On Sunflowers and Matrix Multiplication
We present several variants of the sunflower conjecture of Erdos and Rado and discuss the relations among them. We then show that two of ...
- Speaker:
- Amir Shpilka (CS, Technion)
- Date:
- Wednesday, 24.10.2012, 12:30
- Place:
- Taub 201
SSDL Seminar: Speculative Separation for Privatization and Reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data ...
- Speaker:
- Ayal Zaks (Intel)
- Date:
- Tuesday, 23.10.2012, 12:30
- Place:
- Taub 235
Theory Seminar: Statistical Algorithms and a Lower Bound for Planted Clique
We develop a framework for proving lower bounds on computational problems over distributions, including optimization and unsupervised learning. Our framework is based on defining ...
- Speaker:
- Vitaly Feldman (IBM Research Almaden)
- Date:
- Wednesday, 17.10.2012, 12:30
- Place:
- Taub 201
Haifux Club: Adding Colors To Kademlia
Kademlia is considered to be one of the most effective key based routing protocols. It is nowadays implemented in many file sharing peer-to-peer networks ...
- Speaker:
- Gil Einziger (CS, Technion)
- Date:
- Monday, 15.10.2012, 18:30
- Place:
- Taub 6
Learning to Predict the Future using Web Knowledge and Dynamics
Mark Twain famously said that ``the past does not repeat itself, but it rhymes.'' In the spirit of this reflection, we present novel algorithms ...
- Speaker:
- Kira Radinsky
- Date:
- Tuesday, 9.10.2012, 16:30
- Place:
- Taub 601
The Use of Overloading in Java Programs
Method overloading is a controversial language feature, especially in the context of Object Oriented languages, where its interaction with overriding may lead to confusing ...
- Speaker:
- Keren Lenz
- Date:
- Wednesday, 19.9.2012, 13:00
- Place:
- Taub 601
Pixel Club: The Noise Clinic
All images have noise, but this noise may have undergone many distortions. Can we take any image, say, an olde photograph, and denoise it? ...
- Speaker:
- Jean Michel Morel (CMLA, Ecole Normale Supereure de Cachan, France)
- Date:
- Wednesday, 19.9.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Parameterizing P: Proximity to Easy Variants
The field of Parameterized Complexity strives to solve intractable problems efficiently, via multivariate analysis of running time, as a function of both the input ...
- Speaker:
- David Wajc
- Date:
- Wednesday, 12.9.2012, 14:00
- Place:
- Taub 201
Mathematical Analysis of Emergent Behavior in Multi-Agent Systems
Emergence can be defined as the way complex systems and patterns arise out of a multiplicity of relatively simple interactions. Emergent behavior based systems ...
- Speaker:
- Yotam Elor
- Date:
- Monday, 10.9.2012, 14:30
- Place:
- Taub 401
Haifux Club: The Resource-as-a-Service (RaaS) Cloud
Over the next few years, a new model of buying and selling cloud computing resources will evolve. Instead of providers exclusively selling server-equivalent virtual ...
- Speaker:
- Orna Agmon Ben-Yehuda (CS, Technion)
- Date:
- Monday, 3.9.2012, 18:30
- Place:
- Taub 6
Combined Search Over Heterogeneous Repositories
In complex search tasks that utilize information from several data sources, it is often required to pose several basic search queries, join the answers ...
- Speaker:
- Mirit Shalem
- Date:
- Sunday, 2.9.2012, 13:30
- Place:
- Taub 701
Haifux Club: Placing the Dots: On the Technical Challenges and Cultural Aspects of Typesetting Hebrew Vowel-Marks
This lecture will discuss the challenges presented by Hebrew vowel marks (nikud) with respect to glyph-placement and kerning in (La)TeX and under Linux, as ...
- Speaker:
- Zvi Gilboa (University of Virginia)
- Date:
- Monday, 20.8.2012, 18:30
- Place:
- Taub 6
Haifux Club: Where did Bilski Take Us? Patentability of Software Related Inventions
In the last two decades patenting software relations invention in the US was a flourishing business. Recent ruling by Federal Court and its affirmation ...
- Speaker:
- Doron Sieradzki (pczlaw.com)
- Date:
- Monday, 6.8.2012, 18:30
- Place:
- Taub 6
CGGC Seminar: Linear Asymptotic Subdivision Schemes for Curves and Positive Definite Matrices
Subdivision schemes are attractive methods for generating a smooth object from discrete data by repeating refinements. These schemes have many desirable properties such as ...
- Speaker:
- Uri Itai (Applied Mathematics, Technion)
- Date:
- Sunday, 5.8.2012, 13:00
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Multi-Camera People Tracking
At the CVLAB, EPFL, We have developed a multi-people tracking system. Our system is able to reliably track multiple people in a multi-camera setting. ...
- Speaker:
- Horesh Ben Shitrit (École Polytechnique Fédérale de Lausanne (EPFL), Switzerland)
- Date:
- Tuesday, 31.7.2012, 11:30
- Place:
- EE Meyer Building 1061
Pixel Club: Nearest-Neighbor Searching Under Uncertainty, and Matching a Noisy Curves to a Maps
Nearest-neighbor queries, which ask for returning the nearest neighbor of a query point in a set of points, are important and widely studied in ...
- Speaker:
- Alon Efrat (CS, University of Arizona)
- Date:
- Monday, 30.7.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Haifux Club: Git for Solo Projects Too
Git is well-known as the tool for collaborating in free software projects, and the Linux kernel in particular. What seems to be less known, ...
- Speaker:
- Eli Billauer
- Date:
- Monday, 23.7.2012, 18:30
- Place:
- Taub 3
Approximate Labeled Subgraph Homeomorphism for DAGs
We address a pattern matching problem which has important applications to bioinformatics: Given a labeled pattern graph P and a labeled host graph H, ...
- Speaker:
- Meirav Zehavi
- Date:
- Wednesday, 18.7.2012, 14:30
- Place:
- Taub 701
Pixel Club: Blind Source Separation of Underdetermined Time/Position Varying Mixtures
Blind Source Separation (BSS) is a very applicable and well-studied problem. Most studies of the BSS problem assume the system to be time/position invariant, ...
- Speaker:
- Yotam Michael (EE, Technion)
- Date:
- Tuesday, 17.7.2012, 11:30
- Place:
- EE Meyer Building 1061
Secure Multiparty Computation with Minimal Interaction
In the problem of secure multiparty computation (MPC) we have n parties who want to jointly evaluate a function f on their local inputs. ...
- Speaker:
- Anat Paskin
- Date:
- Tuesday, 10.7.2012, 15:00
- Place:
- Taub 701
Pixel Club: Regularization Cascade for Join
We present a novel algorithm based on a cascade of regularization terms designed to induce implicit hierarchical sharing of information among related learning tasks. ...
- Speaker:
- Alon Zweig (CS and Engineering, The Hebrew University of Jerusalem)
- Date:
- Tuesday, 10.7.2012, 11:30
- Place:
- EE Meyer Building 1061
Haifux Club: Hebrew search: not a trivial task (Hebmorph)
Search engines available today render almost useless when you need to process Hebrew texts. Even effective open-source solutions like Lucene/Solr give up in despair ...
- Speaker:
- Itamar Syn-Hershko
- Date:
- Monday, 9.7.2012, 18:30
- Place:
- Taub 3
Counting-Based Impossibility Proofs for Renaming and Set Agreement
Perhaps the most celebrated results in distributed computing is the impossibility of solving consensus using only read and write operations in asynchronous system where ...
- Speaker:
- Ami Paz
- Date:
- Monday, 9.7.2012, 14:30
- Place:
- Taub 601
Bioinformatics Forum: Deciphering and Modeling the Gene Translation Code and Its Evolution via a Multidisciplinary Approach
Gene translation is a central process in all living organisms. Thus, developing a better understanding of this complex process and its computational modeling have ...
- Speaker:
- Tamir Tuller (Laboratory of Computational Systems Biology, Biomedical Engineering, Tel Aviv University, Tel Aviv)
- Date:
- Wednesday, 4.7.2012, 15:30
- Place:
- Taub 701
ceClub: Derandomizing Replication in Cloud
Randomized node selection is widely used in large-scale, distributed storage systems to both load balance chunks of data across the cluster and select replica ...
- Speaker:
- Asaf Cidon (Stanford University)
- Date:
- Wednesday, 4.7.2012, 11:30
- Place:
- EE Meyer Building 861
Pixel Club: Global Motion Estimation from Point Matches
Multiview structure recovery from a collection of images requires the recovery of the positions and orientations of the cameras relative to a global coordinate ...
- Speaker:
- Mica Arie-Nachimson (Math, Weizmann Institute of Science)
- Date:
- Tuesday, 3.7.2012, 11:30
- Place:
- EE Meyer Building 1061
Pixel Club: Recent results in 3D Urban Modelling
Today's scanning technologies, allow fast 3D scanning of urban scenes. Such rapid acquisition incurs imperfections: large regions remain missing, significant variation in sampling density ...
- Speaker:
- Andrei Sharf (Ben-Gurion University)
- Date:
- Thursday, 28.6.2012, 11:30
- Place:
- EE Meyer Building 1061
Activity Recognition Under Uncertainty using Petri Nets
This talk considers the problem of recognizing activities in surveillance video. Activities are high-level non-atomic semantic concepts which may have complex temporal structure. Activities ...
- Speaker:
- Gal Lavee
- Date:
- Wednesday, 27.6.2012, 16:00
- Place:
- Taub 601
Spatial Proximity of Co-Regulated Yeast Genes
While it has been long recognized that genes are not randomly disposed along the genome, the degree to which the three dimensional (3D) structure ...
- Speaker:
- Shai Ben-Elazar
- Date:
- Wednesday, 27.6.2012, 14:30
- Place:
- Taub 401
ceClub: CORFU: A Shared-Log Design for Network-Attached Flash
CORFU* is a novel storage cluster design that pools a farm of flash units and exposes it to clients as a single, global ...
- Speaker:
- Dahlia Malkhi (Microsoft Research, Silicon Valley)
- Date:
- Wednesday, 27.6.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
Approximation Algorithms for Resource Scheduling and Allocation Problems
We study the bandwidth allocation problem (BAP) and the storage allocation problem (SAP) in bounded degree trees. In BAP, we are given a tree ...
- Speaker:
- Michael Beder
- Date:
- Wednesday, 27.6.2012, 11:30
- Place:
- Taub 601
Pixel Club: Place-Based Information Systems: Textual Location Identification and Visualization
The popularity of web-based mapping services such as Google Earth/Maps and Microsoft Virtual Earth (Bing), has led to an increasing awareness of the importance of ...
- Speaker:
- Hanan Samet (CS, University of Maryland)
- Date:
- Tuesday, 26.6.2012, 14:30
- Place:
- Faculty meeting room, 7th floor, Rabin bldg
Recursion in Distributed Computing
- Speaker:
- Sergio Rajsbaum
- Date:
- Tuesday, 26.6.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Haifux Club: ZeroVM: Lightweight Containers Based on Google Native Client
How cloud-friendly is traditional virtualization? As a matter of fact, all traditional virtualization technologies predate cloud era. Traditional virtualization has major advantage, they are ...
- Speaker:
- Camuel Gilyadov (LiteStack)
- Date:
- Monday, 25.6.2012, 18:30
- Place:
- Taub 3
Theory Seminar: From Irreducible Representations to Locally Decodable Codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message ...
- Speaker:
- Klim Efremenko (Tel-Aviv University)
- Date:
- Wednesday, 20.6.2012, 12:30
- Place:
- Taub 201
ceClub: Sharing Virtual Memory between CPU and GPU
This talk will discuss some system issues related to sharing virtual memory between CPU and GPU, which brings new challenges: GPU page faults, flashing ...
- Speaker:
- Boris Ginzburg (Intel Institute of Computational Intelligence)
- Date:
- Wednesday, 20.6.2012, 11:30
- Place:
- Room 337-8 Taub Bld.
TrustPack: a Decentralized Trust Management Framework
With the rise of the internet and its applications, it has became more and more common for unfamiliar parties to interact with each other. ...
- Speaker:
- Amit Portnoy
- Date:
- Tuesday, 19.6.2012, 15:00
- Place:
- Taub 701
Principles of Reasoning with Graphical Models
- Speaker:
- Rina Dechter
- Date:
- Tuesday, 19.6.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
A Semantic Approach To Graphic User Interface Programming
It is sometimes required to run the same application program on different platforms, from smartphones to PC's. The application may have to employ different ...
- Speaker:
- Motty Porat
- Date:
- Wednesday, 13.6.2012, 14:30
- Place:
- Taub 601
Continuous Symmetries of Non-rigid Shapes
Our world is known for its abundance of symmetric structures - in the fields of the animal kingdom, in astronomy, mathematics and chemistry, to ...
- Speaker:
- Carmi Grushko
- Date:
- Wednesday, 13.6.2012, 14:30
- Place:
- Taub 401
Theory Seminar: Tight Bounds for Parallel Randomized Load Balancing
TBA
- Speaker:
- Christoph Lenzen (The Hebrew University of Jerusalem)
- Date:
- Wednesday, 13.6.2012, 13:00
- Place:
- Taub 201
Active Learning Theory and Practice
Supervised learning, one of the core models of machine learning, is concerned with inducing rules from a given sample of examples. Active learning is ...
- Speaker:
- Ron Begleiter
- Date:
- Wednesday, 13.6.2012, 12:30
- Place:
- Taub 601
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:
- EE Meyer Building 1061
Autonomous Navigation within an Indoor Environment
We address the problem of robot navigation using natural visual features in a planar environment. The algorithm gets as an input a target, which ...
- Speaker:
- Boris Cherevatsky
- Date:
- Wednesday, 13.6.2012, 10:30
- Place:
- Taub 601
Pixel Club: Multiscale Framework for Discrete Energy Minimization)
Discrete energy minimization is a ubiquitous task in computer vision, yet it is NP-hard in most cases. In this work we propose a multiscale ...
- Speaker:
- Meirav Galun (CS, Applied Mathematics, Weizmann Institute of Science)
- Date:
- Tuesday, 12.6.2012, 11:30
- Place:
- EE Meyer Building 1061
Theory Seminar: On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing
Let M be a low-rank matrix. For vectors x,y, define the bilinear form f(x,y)=x^t M y. We study the question of reconstructing M from ...
- Speaker:
- Michael Forbes (MIT)
- Date:
- Wednesday, 6.6.2012, 12:30
- Place:
- Taub 201
The surprises of Quick Sort
- Speaker:
- Micha Hofri
- Date:
- Tuesday, 5.6.2012, 14:30
- Place:
- Room 337-8 Taub Bld.
Pixel Club: Bounded Distortion Mapping Spaces for Triangular Meshes
In this talk we introduce generic convex spaces of bounded distortion piecewise linear mappings of triangular meshes. It is shown how common geometric processing ...
- Speaker:
- Yaron Lipman (Weizmann Institute of Science)
- Date:
- Tuesday, 5.6.2012, 11:30
- Place:
- EE Meyer Building 1061
TCE Guest Lecture: Lane Decoupling for Improving the Timing-Error Resiliency of Wide-SIMD Architectures
A significant portion of the energy dissipated in modern integrated circuits is consumed by the overhead associated with timing guardbands that ensure reliable execution. ...
- Speaker:
- Mattan Erez (University of Texas at Austin)
- Date:
- Sunday, 3.6.2012, 15:30
- Place:
- EE Meyer Building 1061
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
Given a set of $n$ points in $\ell_{1}$, how many dimensions are needed to represent all pairwise distances within a specific distortion ? This ...
- Speaker:
- Ofer Neiman (Ben-Gurion University)
- Date:
- Wednesday, 30.5.2012, 12:30
- Place:
- Taub 201
Pixel Club: Incremental Light Bundle Adjustment For SfM And Multi-robot Localization
Fast and reliable bundle adjustment is essential in many structure from motion (SfM) related applications such as mobile vision, augmented reality and robotics. In ...
- Speaker:
- Vadim Indelman (Robotics and Intelligent Machines (RIM) Center, College of Computing, Georgia Institute of Technology)
- Date:
- Wednesday, 30.5.2012, 11:30
- Place:
- EE Meyer Building 1061
ceClub: A Virtual Mobile Smartphone Architecture
Smartphones are increasingly ubiquitous, and many users carry multiple phones to accommodate work, personal, and geographic mobility needs. We present Cells, a virtualization architecture ...
- Speaker:
- Oren Laadan (CS, Columbia University)
- Date:
- Wednesday, 30.5.2012, 11:30
- Place:
- EE Meyer Building 861
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.
Pixel Club: Reporting Neighbors in High-Dimensional Euclidean Space
We consider the following problem, which arises in many database and web-based applications: Given a set $P$ of $n$ points in a high-dimensional space ...
- Speaker:
- Dror Aiger (Google)
- Date:
- Tuesday, 29.5.2012, 11:30
- Place:
- EE Meyer Building 1061
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, 14:30
- Place:
- EE Meyer Building 1003
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
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.