CS Department Events and Talks

  • Colloq Seminar: New Algorithms for Ranking and Dimension Reduction

    New Algorithms for Ranking and Dimension Reduction The study of ranking crosses many disciplines. Social choice theoreticians have been interested for centuries in finding ...

    Speaker:
    Nir Ailon (Google)
    Date:
    Tuesday, 30.12.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Not only size matters: regularized partial matching of shapes

    Partial matching is probably one of the most challenging problems in shape analysis. The problem consists of matching similar parts of shapes that are ...

    Speaker:
    Michael Bronstein (Novafora, Inc.)
    Date:
    Tuesday, 30.12.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • Theory Seminar: Derandomizing Algorithms on Product Distributions and Improved Implicit Probe Search using Same-source Extractors for very

    An important goal in algorithms and communication protocols is getting the deterministic time complexity, respectively communication complexity, closer to the best known randomized complexity. ...

    Speaker:
    Avinatan Hassidim (M.I.T.)
    Date:
    Sunday, 28.12.2008, 12:00
    Place:
    Taub 601

    [Full version]

  • Simulation and Control of Quantum Systems

    Speaker:
    Ilan Degani
    Date:
    Thursday, 25.12.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Bioinformatics Forum: Discovery of Mechanisms from Mathematical Modeling of DNA Microarray Data: Computational Prediction and Experimental Verification

    DNA microarrays make it possible to record the complete molecular biological signals that guide the progression of cellular processes on genomic scales. I will ...

    Speaker:
    Orly Alter (Biomedical Engineering, University of Texas at Austin)
    Date:
    Thursday, 25.12.2008, 13:30
    Place:
    Taub 601

    [Full version]

  • Theory Seminar: Hypergraph Ramsey Numbers

    Abstract: The Ramsey number $r_k(s,n)$ is the minimum $N$ such that every red-blue coloring of the $k$-tuples of an $N$-element set contains either a ...

    Speaker:
    Benny Sudakov (UCLA)
    Date:
    Wednesday, 24.12.2008, 13:30
    Place:
    Amado 719

    [Full version]

  • Pixel Club Seminar: Organizing Visual Data

    The growth in the number of digital photographs calls for new and improved image editing tools to help users view, navigate and manipulate them. ...

    Speaker:
    Shai Avidan (Adobe Systems Inc.)
    Date:
    Wednesday, 24.12.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • Pixel Club Seminar: Generalized Newton Method for Energy Formulations in Image Processing

    Many problems in image processing are addressed via the minimization of a cost functional. The most prominent optimization technique is the gradient descent, often ...

    Speaker:
    Leah Bar (University of Minnesota, USA)
    Date:
    Tuesday, 23.12.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • Haifux, Linux Haifa Club: Breaking the ice with SELinux (part II)

    We will continue from "Policy syntax" this meeting (after a quick review of the previous one). We will also see how to write an ...

    Speaker:
    Eli Billauer
    Date:
    Monday, 22.12.2008, 18:30
    Place:
    Taub 6

    [Full version]

  • CGGC Seminar: Generating surfaces and animation by refinement of curves and frames

    Subdivision schemes became popular in recent years in applications such as computer graphics and CAGD (computer aided geometric design). Their implementation is rather simple, ...

    Speaker:
    Uri Itai (Mathematics, Technion)
    Date:
    Sunday, 21.12.2008, 12:40
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Colloq Seminar: Building on Conflicts: Computational Studies of Codes

    Many interesting questions in coding theory revolve around conflicts (tradeoffs). Among them are a conflict between structure and randomness, and a conflict between density ...

    Speaker:
    Tali Kaufman (M.I.T.)
    Date:
    Thursday, 18.12.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Bioinformatics Forum: MicroRNAs: from Targets to Function

    Small regulatory RNAs are a class of non-coding RNAs that are primarily involved in post-transcriptional gene silencing. The principle members of this growing class ...

    Speaker:
    Doron Betel (Memorial Sloan-Kettering Cancer Center, N.Y.)
    Date:
    Wednesday, 17.12.2008, 13:30
    Place:
    Taub 701

    [Full version]

  • Small-size $eps$-Nets for Geometric Range Spaces.

    Speaker:
    Esther Ezra
    Date:
    Tuesday, 16.12.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Gradient descent and fast artificial time integration

    Speaker:
    Uri Ascher
    Date:
    Sunday, 14.12.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Approximation and calculation of low-degree polynomials

    We consider private data analysis in the setting in which a trusted and trustworthy curator, having obtained a large data set containing private information, ...

    Speaker:
    Shachar Lovett (Weizmann Institute of Science)
    Date:
    Sunday, 14.12.2008, 12:00
    Place:
    Taub 601

    [Full version]

  • Pixel Club Seminar: Descriptor Based Methods in the Wild

    Recent methods for learning the similarities between images have presented impressive results on the problem of pair-matching (same/not-same classification) of face images. In this ...

    Speaker:
    Tal Hassner (CS, The Open University of Israel)
    Date:
    Tuesday, 9.12.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • Theory Seminar: Hardness amplification proofs require majority

    A function $f$ is $\delta$-hard for some class of circuits if every circuit in the class errs on a $\delta$-fraction of the inputs. For ...

    Speaker:
    Ronen Shaltiel (Haifa University)
    Date:
    Sunday, 7.12.2008, 12:00
    Place:
    Taub 601

    [Full version]

  • Parallel Repetition Theorem Reading Group: Parallel Repetition, Unique Games and Foams?

    In this reading group, we will study the parallel repetition theorem, its connection to unique games and tiling in high dimensional spaces. The parallel ...

    Speaker:
    Prahladh Harsha (CS, University of Texas at Austin)
    Date:
    Wednesday, 3.12.2008, 12:00
    Place:
    Taub 201

    [Full version]

  • Portably preventing file race attacks with user-mode path resolution

    Speaker:
    Dan Tsafrir
    Date:
    Tuesday, 2.12.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Partition Arguments in Multiparty Communication Complexity

    Consider the ``plain'' multiparty communication complexity model, where k players $P_1,\dots,P_k$ holding inputs $x_1,\dots,x_k\in\bit^n$ (respectively) communicate in order to compute the value $f(x_1,\dots,x_k)$. The ...

    Speaker:
    Enav Weinreb (Computer Science, Technion)
    Date:
    Sunday, 30.11.2008, 12:00
    Place:
    Taub 601

    [Full version]

  • Theory Seminar: Using classical topology in combinatorial problems

    The idea of using topology in order to solve combinatorial problems has been known for several decades, but only recently it started to become ...

    Speaker:
    Eli Berger (Haifa University)
    Date:
    Wednesday, 26.11.2008, 13:30
    Place:
    Amado building 719

    [Full version]

  • Robust testing of linear codes

    A code is locally testable if given a word $x \in F^n$ one can verify whether $x \in C$ by reading only a few ...

    Speaker:
    Michael Viderman
    Date:
    Wednesday, 26.11.2008, 12:30
    Place:
    Taub 6

    [Full version]

  • The Netflix Prize: Quest for $1,000,000

    Speaker:
    Yehuda Koren
    Date:
    Tuesday, 25.11.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Lower Bounds for Satisfiability and Related Problems

    Ever since the work of Cook and Levin, satisfiability has been recognized as a central problem in computational complexity. It is widely believed to ...

    Speaker:
    Dieter van Melkebeek (Univ. of Wisconsin)
    Date:
    Sunday, 23.11.2008, 12:00
    Place:
    Taub 601

    [Full version]

  • Church's thesis proof

    Speaker:
    Yuri Gurevich
    Date:
    Wednesday, 19.11.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Regular Specifications of Resource Requirements for Embedded Control Software

    Speaker:
    Gera Weiss
    Date:
    Tuesday, 11.11.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Computer (and Human) Perfection at Checkers

    Speaker:
    Jonathan Schaeffer
    Date:
    Thursday, 6.11.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Refactoring using Type Constraints (previously presented at SAS'07)

    Speaker:
    Frank Tip
    Date:
    Tuesday, 4.11.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Modeling Evolutionary Processes Using Quasispecies Theory

    This talk provides an introduction to quasispecies theory, a framework for modeling evolutionary dynamics that was originally introduced to study problems related to the ...

    Speaker:
    Emmanuel Tannenbaum (Ben Gurion University)
    Date:
    Tuesday, 4.11.2008, 11:30
    Place:
    Taub 4

    [Full version]

  • Cuts and Flows in Directed Graphs

    Speaker:
    Julia Chuzhoy RESCHEDULED
    Date:
    Tuesday, 7.10.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Equilibria in Online Games

    We initiate the study of scenarios that combine both online decision making and interaction between non-cooperative agents. To this end we introduce the notion ...

    Speaker:
    Roee Engelberg
    Date:
    Monday, 6.10.2008, 14:00
    Place:
    Taub 601

    [Full version]

  • Pixel Club Seminar: Compressed Sensing Meets Information Theory

    Sensors, signal processing hardware, and algorithms are under increasing pressure to accommodate ever larger data sets; ever faster sampling and processing rates; ever lower ...

    Speaker:
    Dror Baron
    Date:
    Thursday, 18.9.2008, 11:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • CGGC Seminar: Approximate Greatest Common Divisors and Polynomials Roots
    9:30-11:30, 13:00-15:00, Taub 337

    The discussion of the structured condition number and Gauss' method for computing the roots of a polynomial shows that a sequence of greatest common ...

    Speaker:
    Joab Winkler (CS, University of Sheffield)
    Date:
    Tuesday, 19.8.2008, 09:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • An Efficient Reduction of Ranking to Classification

    Speaker:
    Nir Ailon
    Date:
    Monday, 11.8.2008, 14:30
    Place:
    Room 601 Taub Bld.

    [Full version]

  • Query Understanding using Web Relevance Feedback

    Speaker:
    Andrei Broder
    Date:
    Sunday, 10.8.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: SIPL Annual Projects Presentation

    See program and invitation להלן הזמנה ותוכנית הכנס

    Speaker:
    SIPL, Technion
    Date:
    Thursday, 7.8.2008, 13:30
    Place:
    EE Meyer Building 1003

    [Full version]

  • CGGC Seminar: An Interface for Drawing and Searching Mathematical Figures

    In this talk, I would like to present a user interface for drawing mathematical figures which can be quite complex. The system is based ...

    Speaker:
    Yong-Jun Kim (Computer Science, Seoul National University)
    Date:
    Sunday, 3.8.2008, 12:40
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Pseudorandom graphs - what if distinguishers where first order

    We study the limits of efficient computation in the context of constructing random-looking graph distributions that can be used to emulate huge random graphs ...

    Speaker:
    Asaf Nussbaum (Weizmann Institute of Science)
    Date:
    Sunday, 3.8.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: CT Denoising by K-SVD on the Cell processor

    The K-SVD algorithm is a powerful tool for image denoising but computationally quite intensive. In order to accelerate it we implement the most time ...

    Speaker:
    Dominik Bartuschat (CS, Erlangen University, Germany)
    Date:
    Wednesday, 30.7.2008
    Place:
    Taub 601

    [Full version]

  • Bioinformatics Forum: Whole Population, Genomewide Mapping of Hidden Relatedness

    Identifying and quantifying the sharing of genetic material between individuals within a population is an important step in accurately using genealogical relationships for disease ...

    Speaker:
    Sasha Gusev (Columbia University)
    Date:
    Thursday, 24.7.2008, 13:30
    Place:
    Taub 601

    [Full version]

  • Math-Club Seminar: Probabilistic Reasoning

    Abstract: The discovery that deterministic statements can be proved by probabilistic reasoning, led already more than fifty years ago to several striking results in ...

    Speaker:
    Professor Noga Alon (Tel Aviv University, 2008 Israel Prize recipient)
    Date:
    Wednesday, 23.7.2008, 16:30
    Place:
    Computer Science Taub 1

    [Full version]

  • An optimal coin toss protocol

    Speaker:
    Professor Moni Naor
    Date:
    Monday, 21.7.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Real Time Java

    The lecture topics are: 1) Real Time programming in a nutshell. 2) Programming languages comparison (Real Time related). 3) Java vs. C/C++ with relevant ...

    Speaker:
    Sun Microsystems lecture
    Date:
    Sunday, 20.7.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Two Query PCP with Sub-Constant Error

    We show that the NP-Complete language 3Sat has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant ...

    Speaker:
    Dana Moshkovitz, Weizmann
    Date:
    Sunday, 20.7.2008, 11:00
    Place:
    Taub 337

    [Full version]

  • An Efficient Reduction of Ranking to Classification

    Speaker:
    Nir Ailon (POSTPONED FROM 3/7/08)
    Date:
    Thursday, 17.7.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • The finite harmonic oscillator with applications to radar and communication

    Speaker:
    Ronny Hadani
    Date:
    Tuesday, 15.7.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: The Constant-Depth Complexity of k-Clique

    will discuss a recent lower bound of Omega(n^(k/4)) on the size of depth-d circuits for the k-clique problem on n-node graphs. This improves previous ...

    Speaker:
    Benjamin Rossman (M.I.T.)
    Date:
    Sunday, 13.7.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Bioinformatics Forum: Systems Macro-Biology: Less is More in Disease Biomarkers

    We describe several new methodologies for developing and evaluating novel diagnostics for diabetes and cancer. In the first part of the talk we describe ...

    Speaker:
    Prof. Simon Kasif (Boston University and Children's Hospital, Boston)
    Date:
    Thursday, 10.7.2008, 13:30
    Place:
    Taub 601

    [Full version]

  • Pixel Club Seminar: Active learning in dynamical systems – from robotics to computational biology

    This talk will describe new active learning processes for automated modeling of dynamical systems across a number of disciplines. One of the long-standing challenges ...

    Speaker:
    Prof. Hod Lipson (Mechanical & Aerospace Engineering, Computing & Information Science, Cornell University)
    Date:
    Thursday, 10.7.2008, 11:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • CGGC Seminar: Smooth Surface Fitting (Tutorial)

    The recent ability to measure quickly and inexpensively dense sets of points on physical objects has deeply influenced the way engineers represent shapes in ...

    Speaker:
    Stefanie Hahmann (INPG, Grenoble)
    Date:
    Monday, 7.7.2008, 10:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Combinatorial Construction of Locally Testable Codes

    An error correcting code is said to be locally testable if there is a test that can check whether a given string is a ...

    Speaker:
    Or Meir, (Weizmann Institute of Science)
    Date:
    Sunday, 6.7.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • On the Hardness of Being Truthful

    The central problem in computational mechanism design is the tension between incentive compatibility and computational efficiency. We address this question in the context of ...

    Speaker:
    Michael Schapira
    Date:
    Thursday, 3.7.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: "Cognitive" Memory and its Applications

    Regarding the workings of the human mind, memory and pattern recognition seem to be intertwined. You generally do not have one without the other. ...

    Speaker:
    Prof. Bernard Widrow (EE, Stanford University)
    Date:
    Wednesday, 2.7.2008, 11:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Property Testing and Combinatorial Approximation

    With the recent advances in technology, we are faced with the need to process increasingly larger amounts of data increasingly faster. Originally, a problem ...

    Speaker:
    Arie Matsliah
    Date:
    Wednesday, 25.6.2008, 16:00
    Place:
    Taub 601

    [Full version]

  • List error-correction: New constructions, algorithms, and applications

    Speaker:
    Venkatesan Guruswami
    Date:
    Tuesday, 24.6.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Fenchel Duality with Applications to Inference

    Quite a number of problems involving inference from data, whether visual data or otherwise, fall into the category of optimization. I will describe a ...

    Speaker:
    Amnon Shashua (School of Engineering and Computer Science, Hebrew University of Jerusalem)
    Date:
    Tuesday, 24.6.2008, 14:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Theoretical Results on Robot Localization, Mapping and Goal-Directed Navigation in Unknown Terrain

    Path planning for robots in unknown terrain has been studied in both theoretical robotics and theoretical computer science. However, empirical robotics researchers have often ...

    Speaker:
    Sven Koenig (University of Southern California)
    Date:
    Tuesday, 24.6.2008, 11:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Simple, Fast Simulation and Artistic Control of Cloth and Thin Shells

    What does it take to build fast simulators for cloth and thin shells—in particular to do so with code that is simple to implement, ...

    Speaker:
    Eitan Grinspun (Computer Science, Columbia University)
    Date:
    Sunday, 22.6.2008, 14:00
    Place:
    EE Meyer Building 1061

    [Full version]

  • Theory Seminar: Quantum Multi Prover Interactive Proofs with Communicating Provers

    We introduce a variant of Quantum Multi Prover Interactive Proofs (QMIP), where the provers do not share entanglement, the communication between the verifier and ...

    Speaker:
    Avinatan Hassidim, (Hebrew University of Jerusalem)
    Date:
    Sunday, 22.6.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Beyond Bandlimited Sampling: Nonideal Sampling, Smoothness and Sparsity

    Speaker:
    Yonina Eldar
    Date:
    Tuesday, 17.6.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Sampling Sampling

    Digital processing of analog signals naturally requires a representation of continuous time signals as a discrete-time sequence. The most common representation of this type ...

    Speaker:
    Alan Oppenheim (Massachusetts Institute of Technology)
    Date:
    Sunday, 15.6.2008, 16:00
    Place:
    EE Meyer Building 1003

    [Full version]

  • Bioinformatics Forum: Alternative Splicing Events of Arbitrary Dimension in Splicing Graphs

    Eukaryotic splicing structures are known to involve a high degree of alternative forms derived from a premature transcript by alternative splicing (AS). With the ...

    Speaker:
    Micha Sammeth (Genomic Regulation, Barcelona, Spain)
    Date:
    Sunday, 15.6.2008, 13:30
    Place:
    Taub 701

    [Full version]

  • Theory Seminar: Expander codes, Euclidean Sections, and Compressed Sensing

    Classical results in high-dimensional geometry from the 1970's state that a random subspace of R^N of dimension N/2 has "distortion" O(1) w.h.p where the ...

    Speaker:
    Venkatesan Guruswami, (Washington University)
    Date:
    Sunday, 15.6.2008, 13:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • CGGC Seminar: Formulae and Growth Rates of High-Dimensional Polycubes

    Speaker:
    Gill Barequet (CS, Technion)
    Date:
    Sunday, 15.6.2008, 13:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • An Algebraic Approach to Rule-Based Information Extraction

    Speaker:
    Frederick R. Reiss
    Date:
    Thursday, 12.6.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Math-Club Seminar: On the Security of GSM Cellular Phones

    Abstarct:In this talk we describe the ciphers and protocols used for the GSM cellular phone network, and discuss the (in)security of the system. We ...

    Speaker:
    Eli Biham (Computer Science, Technion)
    Date:
    Wednesday, 11.6.2008, 16:30
    Place:
    Taub 1

    [Full version]

  • Approximate median selection

    Speaker:
    Micha Hofri (NEW DATE instead 5/6)
    Date:
    Wednesday, 11.6.2008, 11:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: 3D Objects Description and Classification by Implicit Polynomials

    3D Objects Description and Classification by Implicit Polynomials

    Speaker:
    Hilla Ben-Yaacov (EE, Technion)
    Date:
    Tuesday, 10.6.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • Theory Seminar: The finite field Kakeya conjecture

    A Kakeya set in F^n, where F is a finite field, is a set containing a line in every direction. The finite field Kakeya ...

    Speaker:
    Zeev Dvir (Weizmann Institute)
    Date:
    Sunday, 8.6.2008, 11:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Approximate median selection

    Speaker:
    Micha Hofri
    Date:
    Thursday, 5.6.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Maximum Degree-Bounded Connected Subgraph: Hardness and Approximation

    Speaker:
    Ignasi sau
    Date:
    Wednesday, 4.6.2008, 15:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • On the Nature of Progress

    Speaker:
    Nir Shavit
    Date:
    Tuesday, 3.6.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Agnostically Learning Decision Trees

    Speaker:
    Adam Kalai
    Date:
    Sunday, 1.6.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • TBA

    Speaker:
    Oded Goldreich - in memory of Shimon Even
    Date:
    Wednesday, 28.5.2008, 16:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Lower Bounds in the Noisy Networks using Sampling Algorithms

    Speaker:
    Jaikumar Radhakrishnan
    Date:
    Tuesday, 27.5.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Logic in Access Control

    Speaker:
    Yuri Gurevich
    Date:
    Sunday, 18.5.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Formulae and growth rates of high-dimensional polycubes

    A $d$-dimensional polycube is a connected set of $d$-dimensional cubes on an orthogonal lattice, where connectivity is through $(d-1)$-dimensional faces. A polycube is said ...

    Speaker:
    CGGC Seminar: Gill Barequet (Computer Science, Technion)
    Date:
    Sunday, 18.5.2008, 14:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Abstraction-Refinement and Modularity in mu-Calculus Model Checking

    Model checking is an automated technique for checking whether or not a given system model fulfills a desired property, described as a temporal logic ...

    Speaker:
    Sharon Shoham Buchbinder
    Date:
    Wednesday, 14.5.2008, 16:00
    Place:
    Taub 601

    [Full version]

  • Natural history and evolutionary principles of gene duplication in fungi

    Speaker:
    Nir Friedman
    Date:
    Tuesday, 13.5.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • CGGC Seminar: Interactive Rendering of Dynamic Geometry

    Fluid simulations typically produce complex three-dimensional iso-surfaces whose geometry and topology change over time. The standard way of representing such dynamic geometry is by ...

    Speaker:
    Kai Hormann (Clausthal Institute of Technology)
    Date:
    Tuesday, 13.5.2008, 11:00
    Place:
    Taub 601

    [Full version]

  • Counting polycubes without the dimensionality curse

    $d$-dimensional polycubes are the generalization of planar polyominoes to higher dimensions. That is, a $d$-D polycube of size $n$ is a connected set of ...

    Speaker:
    CGGC Seminar: Gadi Aleksandrowicz (Computer Science, Technion)
    Date:
    Sunday, 11.5.2008, 13:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Fast acquisition and reconstruction in imaging enabled by sampling theory

    We survey applications of classical and of time-sequential sampling theory and some of its recent extensions, respectively, in two complementary areas. First to reduce ...

    Speaker:
    Yoram Bresler (University of Illinois at Urbana-Champaign)
    Date:
    Tuesday, 6.5.2008, 11:30
    Place:
    Taub 701

    [Full version]

  • Theory Seminar: Developments in the Area of Communication Complexity

    We will describe the results from a series of papers, starting from papers of Forster, Ben-David and others to more recent works of Sherstov ...

    Speaker:
    Adi Shraibman (Math & CS, Weizmann Inst.)
    Date:
    Tuesday, 6.5.2008, 10:30
    Place:
    Taub 401

    [Full version]

  • Designing Competitive Online Algorithms via a Primal-Dual Approach

    In this work we study a wide range of online covering and packing problems with various objectives. We provide a unified approach, based on ...

    Speaker:
    Niv Buchbinder
    Date:
    Wednesday, 16.4.2008, 16:30
    Place:
    Taub 601

    [Full version]

  • Pixel Club Seminar: The Importance of Being Earnest...about Optimality

    I shall discuss the many ways one can do optimal image or signal denoising, and the difficulties in selecting between the various optimal solutions.

    Speaker:
    Alfred M.Bruckstein (Computer Science, Technion)
    Date:
    Sunday, 13.4.2008, 14:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • A Geometric Approach to Detecting Global Properties over Distributed Data

    A basic construct in many distributed systems is the detection of global properties over distributed data. Examples include a wireless sensor network, where we ...

    Speaker:
    Izchak Tzachi Sharfman
    Date:
    Wednesday, 9.4.2008, 16:30
    Place:
    Taub 601

    [Full version]

  • Recent advances in online convex optimization

    Speaker:
    Elad Hazan
    Date:
    Tuesday, 8.4.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Fast Block Motion Estimation Using Gray‐Code Kernels

    Motion estimation plays an important role in modern video coders. In such coders, motion is estimated using a block matching algorithm that estimates the ...

    Speaker:
    Yair Moshe (Computer Science, Haifa Univ.)
    Date:
    Tuesday, 8.4.2008, 11:30
    Place:
    2008-04-01 14:30:00

    [Full version]

  • Painting Rectilinear Pictures Without Picasso

    Speaker:
    Howard Karloff
    Date:
    Sunday, 6.4.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: A combinatorial construction of almost-Ramanujan graphs using the zig-zag product

    Reingold, Vadhan and Wigderson [FOCS'00] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such ...

    Speaker:
    Avraham Ben-Aroya (Tel-Aviv Univ.)
    Date:
    Sunday, 6.4.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Windows Core Architecture: compare and contrast

    Speaker:
    Dave Probert
    Date:
    Thursday, 3.4.2008, 14:30
    Place:
    Taub 2

    [Full version]

  • On the complexity of graph polynomials

    Speaker:
    Markus Blaeser
    Date:
    Tuesday, 1.4.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Geometric deformations

    CGGC Seminar: Deforming objects in a "shape preserving" manner is a challenging problem with various applications in geometric modeling and computer graphics. In this ...

    Speaker:
    Yaron Lipman (Computer Science, Tel Aviv Univ.)
    Date:
    Sunday, 30.3.2008, 13:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Secure Internet Path Quality Monitoring: Tradeoffs in Security and Efficiency

    The basic foundations of the Internet are surprisingly vulnerable to simple attacks that could be mounted by rogue hackers or result from simple misconfiguration. ...

    Speaker:
    David Xiao (Princeton)
    Date:
    Sunday, 30.3.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Towards Universal Semantic Communication

    Speaker:
    Madhu Sudan
    Date:
    Tuesday, 25.3.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Computational Awareness

    Speaker:
    Lance Fortnow
    Date:
    Thursday, 20.3.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Aspects of invariant shape processing

    The lecture deals with invariance in image processing, with emphasis on invariance of shapes and curves. There are two main topics. First, we consider ...

    Speaker:
    Alexander Brook (Computer Science, Technion)
    Date:
    Monday, 17.3.2008, 10:30
    Place:
    Taub 601

    [Full version]

  • Datacenter of the future

    Speaker:
    Tilak Agerwala
    Date:
    Thursday, 13.3.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • The Cloning Method for Combinatorial Optimization, Countingand Rare Events Using Gibbs Sampler

    Speaker:
    Reuven Rubinstein and Andrey Dolgin
    Date:
    Tuesday, 11.3.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Object and Reference Immutability using Java Generics

    Speaker:
    Yoav Zibin
    Date:
    Tuesday, 4.3.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Lower Bounds for Edit Distance Estimation

    The edit distance between two strings is defined as the number of insertions/deletions/substitutions needed to transform one string into the other. This distance plays ...

    Speaker:
    Robert Krauthgamer (Weizmann Institute and IBM Almaden)
    Date:
    Sunday, 2.3.2008, 16:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Moadon Matemati: The longest proof

    The mathematical theorem having the longest proof is the classification of the finite simple groups. In this talk we will try to understand the ...

    Speaker:
    Prof. David Chillag (Mathematics, Technion)
    Date:
    Wednesday, 27.2.2008, 16:30
    Place:
    Taub 1

    [Full version]

  • Pixel Club Seminar: Multi-sensor human action analysis

    Multi-camera environments allow exploiting spatial redundancy that might be used by analysis algorithms to produce more robust results. These algorithms may be applied for ...

    Speaker:
    Cristian Canton-Ferrer (Image and Video Processing Group UPC, Barcelona Spain)
    Date:
    Tuesday, 26.2.2008, 11:00
    Place:
    EE Meyer Building 815

    [Full version]

  • Theory Seminar: Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits

    We show that lower bounds for bounded depth arithmetic circuits imply derandomization of polynomial identity testing for bounded depth arithmetic circuits. More formally, if ...

    Speaker:
    Zeev Dvir (Weizmann Institute of Science)
    Date:
    Sunday, 24.2.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Static Specification Mining Using Automata-Based Abstractions

    Speaker:
    Eran Yahav
    Date:
    Tuesday, 19.2.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: On Isometry, Self-Symmetry, and Biometry

    Our world is filled with nonrigid objects that can deform and bend. Nonrigid shapes appear at all scales - from our body, its organs ...

    Speaker:
    Ron Kimmel
    Date:
    Sunday, 17.2.2008, 14:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • Pixel Club Seminar: On texture and image interpolation using Markov models

    Random field models characterize the correlation among neighboring pixels in an image. Specifically, a wide-sense Markov model is obtained by assuming a separable correlation ...

    Speaker:
    Shira Nemirovsky, EE, Technion
    Date:
    Tuesday, 12.2.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • CGGC Seminar: SolidWorks as geometry engine for engineers

    "The Challenge", Definitions, GUI, basic and smart geometry in 2D and 3D, basic model, "styled" model, shape manipulations, hybrid design, develop challenge.

    Speaker:
    Udi Bahat (Systematics Ltd.)
    Date:
    Sunday, 10.2.2008, 13:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Local testing of direct products

    Given a function f:[n]-->{0,1}, its k-wise direct product encoding is the function F:[n]^k --> {0,1}^k defined by F(x_1,..x_k) = (f(x_1),...,f(x_k)) This simple "encoding" is ...

    Speaker:
    Irit Dinur (Weizmann Institute of Science)
    Date:
    Sunday, 10.2.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • On the complexity of infinite computations

    Speaker:
    Damian Niwinski
    Date:
    Thursday, 7.2.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Using coupling between residues based on evolutionary data for protein structure analysis

    Multiple sequence alignments possess important information, not only about functionally and structurally important conserved regions, but also about coupling between residues. Recently we have ...

    Speaker:
    Eran Eyal (CB, School of Medicine, University of Pittsburgh)
    Date:
    Thursday, 7.2.2008, 13:30
    Place:
    Taub 601

    [Full version]

  • Theory Seminar: The Power of VCG: On Algorithms that are Maximal In Range

    Consider the following simple type of approximation algorithms: limit the set of possible outcomes, and completely optimize over the restricted subrange. In this talk ...

    Speaker:
    Shahar Dobzinski (CS @ Engineering, Huji)
    Date:
    Sunday, 3.2.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • CGGC Seminar: Coupling surface and tetrahedral mesh generation with the restricted Delaunay triangulation

    A Delaunay triangulation restricted to a surface is obtained by filtering a 3D Delaunay triangulation. Filtering herein consists of selecting a subset of the ...

    Speaker:
    Pierre Alliez (CS, INRIA Sophia Antipolis)
    Date:
    Wednesday, 30.1.2008, 15:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Generating Programs from Specifications (with some observations on the modularity of object oriented systems)

    Speaker:
    David Feitelson
    Date:
    Tuesday, 29.1.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Pixel Club Seminar: Image Processing using Diffusion with Schrödinger's Potential

    The complex diffusion process, recently introduced in image processing and computer vision by combining the linear diffusion equation and the 'free-particle' Schrödinger equation, is ...

    Speaker:
    Ori Honigman (EE, Technion)
    Date:
    Tuesday, 29.1.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • CGGC Seminar: A decade of CGAL arrangements and applications

    The Computational Geometry Algorithms Library, CGAL, is the largest software collection of algorithms and data structures in Computational Geometry available today. It started a ...

    Speaker:
    Dan Halperin, Dept. of Computer Science, Tel Aviv University
    Date:
    Sunday, 27.1.2008, 13:00
    Place:
    Taub 337

    [Full version]

  • Theory Seminar: Trapdoors for Hard Lattices, and New Lattice-based Cryptography

    We show that disjointness requires randomized communication Omega(n^{1/2k} / (k-1)2^{k-1}2^{2^{k-1}}) in the general k-party number-on-the-forehead model of complexity. The previous best lower bound was ...

    Speaker:
    Vinod Vaikuntanathan, MIT
    Date:
    Sunday, 27.1.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Theory Seminar: Disjointness is hard in the multi-party number-on-the-forehead model

    We show that disjointness requires randomized communication Omega(n^{1/2k}/{(k-1)2^{k-1}2^{2^{k-1}}) in the general k-party number-on-the-forehead model of complexity. The previous best lower bound was Omega((log n)/k-1). ...

    Speaker:
    Adi Shraibman, Weizmann Institute of Science
    Date:
    Sunday, 20.1.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Learning From Related Sources

    Speaker:
    Koby Crammer
    Date:
    Tuesday, 15.1.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Recovering detailed 3D models of human shape and pose from images

    Algorithms for video-based human motion capture typically assume the body shape is known a priori and is represented coarsely (e.g. using cylinders to model ...

    Speaker:
    Michael Black
    Date:
    Monday, 14.1.2008, 11:00
    Place:
    Taub 337

    [Full version]

  • Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extra

    In this paper we study multilinear formulas, monotone arithmetic circuits, maximal partition discrepancy, best partition communication complexity and mixed two source extractors. We will ...

    Speaker:
    Amir Yehudayoff
    Date:
    Sunday, 13.1.2008, 11:00
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Making large problems seem small: Convex duality in learning and inference

    Speaker:
    Amir Globerson
    Date:
    Thursday, 10.1.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Variational Image Restoration

    This research concerns the image deblurring and noise removal problem in a variational framework. Energy functionals in this study consist of a fidelity term ...

    Speaker:
    Leah Bar
    Date:
    Thursday, 10.1.2008, 11:00
    Place:
    EE Meyer Building 1061

    [Full version]

  • Worst-case complexity vs. average-case complexity

    Speaker:
    Dan Gutfreund
    Date:
    Tuesday, 8.1.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • The Role of Exemplars Comparison in Category Learning: The Emergence of Expertise

    Recent studies stressed the importance of objects comparison for category learning. Recently we compared adults' capacity to learn new categorization principle in a condition ...

    Speaker:
    Rubi Hammer
    Date:
    Tuesday, 8.1.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • Integrative Biology and System-wide analyses in Tumor Formation

    Speaker:
    Sol Efroni
    Date:
    Sunday, 6.1.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • 3D Virtual Colonoscopy with Computer-Aided Polyp Detection

    This talk describes 3D virtual colonoscopy (VC), a combination of computed tomography (CT) scanning and volume visualization technology, and is poised to become the ...

    Speaker:
    Arie Kaufman
    Date:
    Sunday, 6.1.2008, 11:30
    Place:
    EE Meyer Building 1061

    [Full version]

  • Cellular Developmental Decisions: From Single Cell Dynamics to Population Strategies

    Speaker:
    Iftach Nachman
    Date:
    Wednesday, 2.1.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]

  • Sufficient conditions for local-to-global computations

    Speaker:
    Tali Kaufman
    Date:
    Tuesday, 1.1.2008, 14:30
    Place:
    Room 337-8 Taub Bld.

    [Full version]