דלג לתוכן (מקש קיצור 's')
Logo of Technion
Logo of CS Department
אירועים

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

Efficient cloud operations via job-migration and pricing
event speaker icon
Ishai Menache
event date icon
יום חמישי, 30.12.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Practical Parallel Imaging Compresses Sensing MRI: Summary of Two Years of Experience Accelerating Body MRI of Pediatric Patients
event speaker icon
מיכאל לוסטיג (אונ' קליפורניה בברקלי)
event date icon
יום חמישי, 30.12.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Magnetic Resonance Imaging has revolutionized diagnostic medicine. It is an excellent tool for disease diagnosis and monitoring, offering superb soft tissue contrast and high anatomic resolution; unlike computed tomography (CT), it lacks of ionizing radiation. However MRI suffers from several shortcomings, one of which is the inherently slow data acquisition. This has limited the penetration of MRI to applications that require sharp images of fast moving small body parts, such as angiography, cardiovascular imaging, imaging ...
[לנוסח המלא]
Theory Seminar: Sequential Rationality in Cryptographic Protocols
event speaker icon
נעם ליבנה (מכון ויצמן למדע)
event date icon
יום רביעי, 29.12.2010, 12:20
event location icon
חדר 337, בניין טאוב למדעי המחשב
Much ofMuch of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationally-bounded players and the asymptotic nature of cryptographic security, a definition of sequential rationality for this setting has thus far eluded researchers. We propose a new framework for overcoming these obstacles, and provide the first definitions of computational solution concepts that guarantee sequential rationality. We argue that natural computational variants of subgame ...
[לנוסח המלא]
Pixel Club Seminar: Multi-Manifold Data Modeling: Foundations and Applications
event speaker icon
גלעד לרמן (מתמטיקה, אונ' מינסוטה)
event date icon
יום רביעי, 29.12.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
We present several methods for multi-manifold data modeling, i.e., modeling data by mixtures of possibly intersecting manifolds. We focus on algorithms for the special case where the underlying manifolds are affine or linear subspaces. We emphasize various theoretical results supporting the performance of some of these algorithms, in particular their robustness to noise and outliers. We demonstrate how such theoretical insights guide us in practical choices and present applications of such algorithms. This is part ...
[לנוסח המלא]
Bioinformatics Forum (NOTE UNUSUAL HOUR): Single Molecule Sequencing Based Digital Gene Expression - Investigating the Transcriptome through a Clearer Lens
event speaker icon
דורון ליפסון (Foundation Medicine Inc)
event date icon
יום שלישי, 28.12.2010, 15:00
event location icon
טאוב 601
Digital Gene Expression (DGE) profiling by next-generation sequencing (NGS) technologies has the potential of becoming the leading method for quantitative analysis of complete transcriptomes. While similar approaches have been implemented in the past by methods such as SAGE, one of the key advantages of NGS technologies is an extremely high throughput which enables accurate quantification over a wide dynamic range of transcript abundances, as well as relatively low sample preparation bias. In this talk I ...
[לנוסח המלא]
GraphLab: Asynchronous Graph Computation in the Clouds and Beyond
event speaker icon
Danny Bickson
event date icon
יום שלישי, 28.12.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club: Voxel Fabbing: From Analog to Digital 3D Printing
event speaker icon
הוד ליפסון (אונ' קורנל, ניו-יורק)
event date icon
יום שלישי, 28.12.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
The transition from analog to digital has revolutionized many fields over the past century – most notably computation and communication – and can be used to similarly revolutionize additive manufacturing technology. In contrast with continuous (analog) materials produced by traditional rapid prototyping, digital materials are composed of many discrete, self-aligning voxels placed in a massively parallel layer deposition process. Digital principles allow for perfect replication and zero noise despite using a noisy and inaccurate substrate. ...
[לנוסח המלא]
CGGC Seminar: AKVFs - A New Computational Tool for Approximate Shape
event speaker icon
מירלה בן-חן (אונ' סטנפורד)
event date icon
יום שלישי, 28.12.2010, 10:30
event location icon
טאוב 7
A fundamental problem in geometry processing is to characterize the possible transformations a shape can undergo, and still remain "the same". Such transformations are called isometries, since they preserve some notion of distance between all points on the shape. In many cases, however, especially when dealing with discrete shapes, approximate isometries better characterize the wealth of shapes which represent the same object, such as different poses of a character. Such maps are harder to represent ...
[לנוסח המלא]
AKVFs - A New Computational Tool for Approximate Shape Isometries
event speaker icon
Mirela Ben-Chen
event date icon
יום שלישי, 28.12.2010, 10:30
event location icon
חדר טאוב 7 טאוב.
Anisotropic diffusion maps of sub-manifolds with applications
event speaker icon
Dan Kushnir
event date icon
יום ראשון, 26.12.2010, 14:30
event location icon
חדר 337-8 טאוב.
Requirements Determination is Unstoppable: An Experience Report
event speaker icon
Daniel M. Berry SPECIAL LECTURE note unusual hour
event date icon
יום ראשון, 26.12.2010, 12:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: May the Optimal Candidate Win! Optimization under Social Choice Constraints
event speaker icon
Ariel Procaccia
event date icon
יום חמישי, 23.12.2010, 14:30
event location icon
חדר 337-8 טאוב.
CSpecial Talk: Topology in Distributed Computing
event speaker icon
פרופ' אלי גפני (UCLAׁ
event date icon
יום רביעי, 22.12.2010, 14:30
event location icon
טאוב 5
The integer 1 is the unity of multiplication. The integer 12 represents the senior high-school year. They surely are different in many respects. But distributed computing does not multiply, neither it attends school, so why should it distinguish between the two integers? I refer to the nice generalization of consensus introduced by Chaudhuri called k-set consensus. While in consensus processors vote for a unique participating processor to be their representative, in set consensus their vote ...
[לנוסח המלא]
Bandwidth Allocation in Cellular Networks with Multiple Interferences
event speaker icon
גלב פולבוי
event date icon
יום רביעי, 22.12.2010, 14:00
event location icon
טאוב 601
We study the problem of bandwidth allocation with multiple interferences. In this problem the input consists of a set of users and a set of base stations. Each user has a list of requests, each consisting of a base station, a frequency demand, and a profit that may be gained by scheduling this request. The goal is to find a maximum profit set of user requests $\calS$ that satisfies the following conditions: 1) $\calS$ contains ...
[לנוסח המלא]
Theory Seminar: Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
event speaker icon
ניר אילון (מדעי המחשב, הטכניון
event date icon
יום רביעי, 22.12.2010, 12:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate. Here, we employ new tools from probability in Banach spaces that were successfully used in the context of sparse reconstruction to advance on an open problem in random pojections. In particular, we generalize and use an intricate result by Rudelson and Vershynin for sparse reconstruction which uses ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Creative Commons Licenses, Open Source Software Licenses & the new Israeli Copyright Act of 2007
event speaker icon
דלית קן-דרור (אוניברסיטת חיפה)
event date icon
יום שני, 20.12.2010, 18:30
event location icon
טאוב 6
Part I of the talk covered the new Israeli Copyright Act of 2007. This part of the talk will focus on Creative Commons Licenses.
[לנוסח המלא]
Pixel Club Seminar: Reconstructing the World from Photos on the Internet
event speaker icon
סטיב סייץ (אונ' וושינגטון)
event date icon
יום חמישי, 16.12.2010, 11:30
event location icon
EE Meyer Building 1061
‏There's a big difference between looking at a photograph of a place and being there. But what if you had access to a database of every possible image of that place and could conjure up any view at will? With billions of photographs currently available online, the Internet is beginning to resemble such a database, capturing our world's sites from a huge number of vantage points and viewing conditions. For example, a Google image search ...
[לנוסח המלא]
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
event speaker icon
אריאל קוליק
event date icon
יום רביעי, 15.12.2010, 16:30
event location icon
טאוב 601
Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks. We consider the problem of maximizing any submodular function subject to $d$ knapsack constraints, where $d$ is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through {\em extension by expectation} of the submodular function. Formally, we show that, for any non-negative submodular ...
[לנוסח המלא]
Pixel Club Seminar: Efficient Linear Sketches for the Set Query Problem
event speaker icon
אריק פרייס (MIT)
event date icon
יום רביעי, 15.12.2010, 13:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Sparse recovery, or compressive sensing, is the problem of approximating a vector x from a low-dimensional linear sketch Ax, where A is an m x n matrix with m We give a framework for sparse recovery where the problem is split into two parts. In the first part we locate the large coefficients of x, and in the second part we estimate their values (termed the "set query problem"). We give an optimal algorithm for ...
[לנוסח המלא]
Theory Seminar: Local List-Decoding with a Constant Number of Queries
event speaker icon
קלים אפרנקו (אונ' ת"א)
event date icon
יום רביעי, 15.12.2010, 12:20
event location icon
חדר 337, בניין טאוב למדעי המחשב
Recently there was constructed locally-decodable codes of sub-exponential length. This result showed that these codes can handle up to one third fraction of errors. In this talk we show that the same codes can be locally unique-decoded from error rate upto half and locally list-decoded from error rate $1-\alpha$ for any $\alpha>0$, with only a constant number of queries and a constant alphabet size. This gives the first sub-exponential codes that can be locally list-decoded ...
[לנוסח המלא]
CGGC Seminar: Surface Comparison using Conformal Geometry
event speaker icon
ירון ליפמן (אונ' פרינסטון)
event date icon
יום רביעי, 15.12.2010, 11:30
event location icon
טאוב 5 (קומה 1)
In this talk we will present three applications of conformal geometry to the problems of surface matching and comparison. In particular we will show how certain ideas originated in the theory of conformal geometry can be used to define novel metrics measuring dissimilarities and finding correspondences betweens pairs of surfaces automatically. The prominent rigidity of conformal mappings renders these metrics computationally efficient, add suggests that conformal geometry can play a role in reducing the complexity ...
[לנוסח המלא]
Retro: An "Alway There" and "Not in The Way" Snapshot System
event speaker icon
Liuba Shrira
event date icon
יום שלישי, 14.12.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Topics in Distributed Robotics
event speaker icon
אלאן וינפילד (hp ואונ' בריסטול, אנגליה)
event date icon
יום שלישי, 14.12.2010, 12:30
event location icon
טאוב 401
Pixel Club Seminar: Toward Optimal Real-Time Transcoding of Images and Video Data Using Requantization
event speaker icon
אורה גנדלר (הנדסת חשמל, הטכניון)
event date icon
יום שלישי, 14.12.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Visual communication often requires adaptation of the transmission bit-rate to the available channel bandwidth or display characteristics of the end users. In this work, requantization for transrating of MPEG video sequences and JPEG still images is analyzed. We show that both the rate and the distortion of requantized images and video depend mainly on the ratio between the new and the original quantization steps. Our analysis is based on the structure of the quantizer and ...
[לנוסח המלא]
Theory Seminar: On the Semantics of Local Characterizations for Linear-Invariant Properties
event speaker icon
ג'קוב נורדסטרום (אונ' סטוקהולם, שוודיה)
event date icon
יום רביעי, 8.12.2010, 12:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
A property of functions on a vector space is said to be linear-invariant if it is closed under linear transformations of the domain. Linear-invariant properties are some of the most well-studied properties in the field of property testing. Testable linear-invariant properties can always be characterized by so-called local constraints, and of late there has been a rapidly developing body of research investigating the testability of linear-invariant properties in terms of their descriptions using such local constraints. One problematic aspect that has been ...
[לנוסח המלא]
Pixel Club Seminar: Combined Local-Global Background Modeling for Anomaly Detection in Hyperspectral Images
event speaker icon
איל מדר (הנדסת חשמל, הטכניון)
event date icon
יום שלישי, 7.12.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
In this research, we address the problem of anomaly detection using remotely sensed spectral information collected by hyperspectral sensors. Anomaly detection algorithms first model the abundant material spectra (background). Then, every pixel spectrally different in a meaningful way from the background is declared to be an anomaly pixel. Two major approaches to statistical background modeling can be distinguished: “the local approach” and “the global approach”. Local algorithms can tightly fit the background process but are ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Creative Commons Licenses, Open Source Software Licenses & the new Israeli Copyright Act of 2007
event speaker icon
דלית קן-דרור (אוניברסיטת חיפה)
event date icon
יום שני, 6.12.2010, 18:30
event location icon
טאוב 6
Applications of Shellable Complexes to Distributed Computing
event speaker icon
Maurice Herlihy
event date icon
יום שלישי, 30.11.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Single Image Head Orientation and Gaze Detection
event speaker icon
ג'רמי קמינסקי (מ"מ, מכון טכנולוגי, חולון)
event date icon
יום שלישי, 30.11.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
We introduce a system to compute both head orientation and gaze detection from a single image. The system uses a camera with fixed parameters and requires no user calibration. Our approach to head orientation is based on a geometrical model of the human face, and is derived from morphological and physiological data. Eye gaze detection is based on a geometrical model of the human eye. Two new algorithms are introduced that require either two or ...
[לנוסח המלא]
Connecting the Dots Between News Articles
event speaker icon
Dafna Shahaf SPECIAL GUEST LECTURE
event date icon
יום ראשון, 28.11.2010, 11:00
event location icon
חדר 337-8 טאוב NOTE UNUSUAL DAY AND TIME Bld.
New Techniques for the Cryptanalysis of Hash Functions
event speaker icon
רפי חן
event date icon
יום רביעי, 24.11.2010, 14:00
event location icon
טאוב 601
Cryptographic hash functions take a message of arbitrary length and generate a short fingerprint. Their main use are for digital signatures, due to their collision resistance property, i.e., that it is hard to find two different messages that have the same fingerprint. In this talk we present novel cryptanalysis techniques that we developed to attack hash functions. These techniques improve the functionality of differential attacks against the collision resistance property of the hash functions. We ...
[לנוסח המלא]
Theory Seminar: The Topology of Shared-memory Adversaries
event speaker icon
פרופ' מוריס הרלי (אוניברסיטת בראון)
event date icon
יום רביעי, 24.11.2010, 12:20
event location icon
חדר 337, בניין טאוב למדעי המחשב
Failure patterns in modern parallel and distributed system are not necessarily uniform. The notion of an adversary scheduler is a natural way to extend the classical wait-free and t-faulty models of computation. A well-established way to characterize an adversary is by its set of cores, where a core is any minimal set of processes that cannot all fail in any execution. We show that the protocol complex associated with an adversary is (c-2)-connected, where c ...
[לנוסח המלא]
Approximated Learning and Inference in Large Scale Graphical Models
event speaker icon
Tamir Hazan
event date icon
יום שלישי, 23.11.2010, 14:30
event location icon
חדר 337-8 טאוב.
Haifux, Haifa Linux Club: The Cairo Graphics Compositing Library
event speaker icon
בעז גולדשטיין
event date icon
יום שני, 22.11.2010, 18:30
event location icon
טאוב 6
The Cairo graphics library has become an integral part of open source graphics, being the bases for quality graphics in various projects, such as Gnome and Fire fox. This lecture will cover its abilities, future direction and give a brief intro to using it.
[לנוסח המלא]
Communication-Efficient Self-Stabilization Using Gossip.
event speaker icon
דמיטרי זיננקו
event date icon
יום רביעי, 17.11.2010, 14:00
event location icon
טאוב 601
A self-stabilizing algorithm is a distributed algorithm that converges to a legal solution from any initial configuration. Most self-stabilizing protocols rely on checking every neighbor of every processor continuously to detect inconsitencies. Such protocols have a high communication cost, especially in dense networks. We investigate the potential usefulness of gossip for improving the communication efficiency of self-stabilizing protocols. We present randomized low communication self-stabilizing algorithms for several major tasks, namely, spanning tree construction, distributed reset, ...
[לנוסח המלא]
Bioinformatics Forum: Identification of Rare Alleles and their Carriers using Compressed Se(que)nsing
event speaker icon
נועם שנטל (מדעי המחשב, האונ' הפתוחה)
event date icon
יום רביעי, 17.11.2010, 13:30
event location icon
טאוב 701
Identification of rare variants by resequencing is important both for detecting novel variations and for screening individuals for known disease alleles. New technologies enable low-cost resequencing of target regions, although it is still prohibitive to test more than a few individuals. We propose a novel pooling design that enables the recovery of novel or known rare alleles and their carriers in groups of individuals. The method is based on a Compressed Sensing (CS) approach, which ...
[לנוסח המלא]
Theory Seminar: Hats Auctions and Derandomization
event speaker icon
אורן בן-צבי (הטכניון)
event date icon
יום רביעי, 17.11.2010, 12:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Goldberg, Hartline and Wright [SODA 2001] introduced the notion of 'competitive analysis' into 'auction theory' when dealing with 'unlimited supply', 'unit demand', 'single item' auctions. They proved that there exists random auctions that guaranty constant 'competitive ratio' and that no deterministic auction can guaranty that. Aggarwal, Fiat, Goldberg, Hartline, Immorlica and Sudan [STOC 2005] showed that the 2001 conclusion was wrong and that there exist deterministic asymmetric auction with constant competitive ratio. They also show ...
[לנוסח המלא]
Pixel Club Seminar: Representation, Processing and Animation of Images via Geometric Models
event speaker icon
יוסף יומדין (מכון ויצמן למדע)
event date icon
יום שלישי, 16.11.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
In this talk I plan to discuss some results on image representation and processing via geometric models, in two extreme scales: 1. The finest scale representation is usually called "vectorization". Here the models are analytic aggregates mainly constructed from edges and ridges, equipped with their "extended color profiles". We provide some experimental data stressing the importance of accurate and flexible ``color profiles" of edges and ridges in our visual perception. Accordingly, the extended color profiles ...
[לנוסח המלא]
Theory Seminar: Deterministic Construction of a high dimensional ell-p section in ell-1^n for any p<2 (and its implications in compressed sensing)
event speaker icon
זהר קרנין (מדעי המחשב, הטכניון)
event date icon
יום רביעי, 10.11.2010, 12:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
For any $00$, we give an efficient deterministic construction of a linear subspace $V \subseteq \R^n$, of dimension $(1-\epsilon)n$ in which the $\ell_p$ and $\ell_r$ norms are the same up to a multiplicative factor of $\poly(\epsilon^{-1})$ (after the correct normalization). As a corollary we get a deterministic compressed sensing algorithm (Base Pursuit) for a new range of parameters. In particular, for any constant $\epsilon>0$ and $p Our construction has the additional benefit that when viewed ...
[לנוסח המלא]
Size-space tradeoffs in propositional proof complexity
event speaker icon
Eli Ben-Sasson
event date icon
יום שלישי, 9.11.2010, 14:30
event location icon
חדר 337-8 טאוב.
Haifux, Haifa Linux Club: SSDL & Linux – a Love story or a Battle field? How to Change to Linux and Survive (Give or Take)
event speaker icon
שחר דג (המעבדה לפיתוח תוכנה ומערכות -SSDL)
event date icon
יום שני, 8.11.2010, 18:30
event location icon
טאוב 6
SSDL & Linux – a Love story or a Battle field? In the talk I will describe the process of moving (almost) all the computers of SSDL (the System & Software Development Laboratory at the Computer science faculty - Technion) from Windows to Linux. I will talk about the rezones for the move and about the benefits & drawback of Linux from the administrator (that is me) point of view and from the student's point ...
[לנוסח המלא]
Gravity currents as a test case: do simple mathematical models produce good physical insights, or do good insights generate powerful models?
event speaker icon
Marius Ungarish
event date icon
יום שלישי, 2.11.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Navigation Performance Enhancement using Online Mosaicking
event speaker icon
ודים אינדלמן (הנדסת אווירונאוטיקה, טכניון)
event date icon
יום שלישי, 2.11.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Since the Global Positioning System (GPS) was established in the 1970s, navigation has become a much easier task. Indeed, the majority of navigation systems rely on the GPS signal for correcting the developing dead reckoning errors. However, GPS is unavailable or unreliable indoors, underwater, in urban environments, and on other planets. In these scenarios, one must use alternative techniques for updating the Inertial Navigation System (INS), or any other dead reckoning mechanism being used. This ...
[לנוסח המלא]
Dependent UFP On a Shared Channel With Application to a Network Centric Operation
event speaker icon
איליה נודלמן
event date icon
יום רביעי, 27.10.2010, 14:00
event location icon
טאוב 601
In this talk we generalize the well-known Unsplittable Flow Problem (UFP) and show its applicability to the emerging Network Centric Operations (NCO) concept. While UFP's goal is to maximize the profit gained by accommodating independent flows, our generalization considers dependent flows. In the generalized problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP), the profit from delivering two flows is not necessarily equal to the sum of their profits. We show that in a ...
[לנוסח המלא]
Pixel Club Seminar: Transcription and Classification of Audio data by Sparse Representations and Geometric Methods
event speaker icon
מיכל גנוסוב (הנדסת חשמל, טכניון)
event date icon
יום רביעי, 27.10.2010, 13:30
event location icon
EE Meyer Building 1061
Transcription and Classification of Audio Data by sparse Representations and Geometric Methods
[לנוסח המלא]
Haifux, Haifa Linux Club: Secure File Systems
event speaker icon
אור דונקלמן (מכון ויצמן למדע)
event date icon
יום שני, 25.10.2010, 18:30
event location icon
טאוב 6
In this talk I shall cover two concepts related to protecting your information, cryptographic file system and steganographic file system. A cryptographic file system is a file system where the data stored is encrypted by the operating system (thus, protecting the confidentiality of the information in case the hard disk is taken away). A steganographic file system is a file system which is hidden from prying eyes, namely, that a person holding the hard disk ...
[לנוסח המלא]
Completeness and Universality Properties of Graph Invariants and Graph Polynomials
event speaker icon
איליה אברבוך
event date icon
יום רביעי, 20.10.2010, 14:00
event location icon
טאוב 601
Graph polynomials are powerful and well-developed tools to express graph parameters. Usually graph polynomials are compared to each other by ad-hoc means allowing to decide whether a newly defined graph polynomial generalizes (or is generalized) by another one. We study their distinctive power and introduce the notions of $dp$-completeness and universality of graph polynomials in order to formalize dependencies between them. Many known graph polynomials satisfy linear recurrence relations with respect to some set of ...
[לנוסח המלא]
Pixel Club Seminar: Schizophrenic(*) Perspective on Software Testing
event speaker icon
יוסי גיל (מדעי המחשב, טכניון)
event date icon
יום רביעי, 20.10.2010, 12:30
event location icon
טאןב 2
In this talk, I will present my personal perspective on software testing and quality, a perspective which is torn between being an academic interested in programming languages, and my earthly experience, working for the last two years as a programmer in the trenches with Google and IBM. This talk is a re-run of an invited talk at HVC'10 conference. (*) As will be explained in my talk, the term "schizophrenic" is used here in a ...
[לנוסח המלא]
Pixel Club Seminar: Reading into the MAP: how mean is it ?
event speaker icon
רמי גריבונבאל (INRIA)
event date icon
יום שלישי, 19.10.2010, 14:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Should penalized least squares regression be interpreted as Maximum A Posteriori estimation? Penalized least squares regression is often used for signal denoising and inverse problems, and is commonly interpreted in a Bayesian framework as a Maximum A Posteriori (MAP) estimator, the penalty function being the negative logarithm of the prior. For example, the widely used quadratic program (with an $\ell^1$ penalty) associated to the LASSO / Basis Pursuit Denoising is very often considered as the ...
[לנוסח המלא]
Should penalized least squares regression be interpreted as Maximum A Posteriori estimation? Subtitle: Reading into the map: how mean is it ?
event speaker icon
Remi Gribonval
event date icon
יום שלישי, 19.10.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Integrating Computer Graphics and Computer Vision in Virtual Humans Projects
event speaker icon
סוריה ראופ מוס (מדעי המחשב, PUCRS)
event date icon
יום שלישי, 19.10.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
In this talk I'll present some research topics supervised by me during the last 10 years in VHLab, mainly in the context of Virtual Humans, and, more recently, in computer vision (CV) integrated with computer graphics (CG). Firstly, I'll discuss topics focused on virtual humans simulation and open problems. Then, integration between CG and CV is presented, applied in practical and relevant areas.
[לנוסח המלא]
Pixel Club Seminar: Sparsity-Based Signal Models and the Sparse K-SVD Algorithm
event speaker icon
רן רובינשטיין (מדעי המחשב, הטכניון)
event date icon
יום שלישי, 5.10.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Signal models are used for a wide array of signal and image processing tasks – from deconvolution, denoising, and interpolation to source separation, super-resolution, and compression. One of the most common modeling approaches utilizes a dictionary of atomic signals, describing the set of elementary behaviors observed in the signals of interest. The dictionary is used either as an analysis operator, measuring the inner-products of the atoms and the input signal, or as a synthesis operator, ...
[לנוסח המלא]
Haifux, Haifa Linux Club: The Hitchhikers' Guide to the SHA-3 Competition
event speaker icon
אור דונקלמן (מכון ויצמן למדע)
event date icon
יום שני, 4.10.2010, 18:30
event location icon
טאוב 6
Following the advances in the cryptanalysis of hash functions in the last years, and especially the alarming results on SHA1 and Merkle-Damgard hash functions, NIST has started a cryptographic competition to offer secure and fast hash function standard, to be named SHA3. The competition, currently at its second phase (with 14 remaining candidates), is the focus of many efforts in cryptanalysis and implementation. In this talk, we shall cover some of the aspects of this ...
[לנוסח המלא]
Pixel Club Seminar: Blind Source Separation of Instantaneous
event speaker icon
מיכאל שמיש (הנדסת חשמל, הטכניון)
event date icon
יום שלישי, 21.9.2010, 14:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Blind source separation of images and voice signals is a well known and well studied subject. Solutions for this problem have various applications, such as separation of voices of multiple speakers in the same room, denoising, separation of reflections superimposed on images, and more. Classical time/position invariant Blind Source Separation is usually solved using Independent Component Analysis (ICA), which tries to find statistically independent signals as a linear combination of the mixed signals, or by ...
[לנוסח המלא]
Pixel Club Seminar: Surface and Volume Mapping via Mass Transport
event speaker icon
איילת דומיניץ (הנדסת חשמל, הטכניון)
event date icon
יום שלישי, 21.9.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
In this talk, we present novel approaches for mapping surfaces and volumes to corresponding canonical domains with the same topology. In general we wish to find a bijection of the sampled surface or volume lying in 3D space with a simpler model, that respectively preserves the area or volume distribution and minimally distort the local geometry. Many of the operations we wish to perform on the discrete surface or volume, for processing, analysis or visualization, ...
[לנוסח המלא]
Bioinformatics Forum: Towards The Systems Biology of Breast Cancer: Exploiting Multilevel Molecular Data of High Dimension
event speaker icon
מרים רייגל אאור ואולה-כריסטיאן לינגזרד (אונ' ובי"ח אוסלו, נורווגיה)
event date icon
יום רביעי, 15.9.2010, 13:30
event location icon
טאוב 601
Cancer is a worldwide burden with several million deaths annually and the situation is set to worsen globally as the population ages, with a projected increase of 45% to 2030 according to the WHO. Current cancer management is mainly focused on intervention after tumors have been detected; however, there is a drive towards very early detection and intervention to reduce the risk of metastatic disease. Novel methodology is emerging to allow modulation of tumor progression ...
[לנוסח המלא]
Pixel Club Seminar: Image Sequence Processing Without Motion Estimation
event speaker icon
מתן פרוטר (מדעי המחשב, הטכניון)
event date icon
יום שלישי, 14.9.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
YouTube movies, live streaming, TV broadcast, conference calls and more - there is no doubt that video sequences are abundant and in everyday use. However, the quality of these videos is rarely satisfactory. This may be the result of network limitations, low-quality imaging devices and more. Improving the quality of videos has been long studied by the research community. Rather than independently improving the quality of each image in the sequence, it has been observed ...
[לנוסח המלא]
Pixel Club Seminar: A Parallel Algorithm for Sparse Demixing - Applied to Retinal Imaging and Remote Sensing
event speaker icon
מרטין אהלר (אונ' קולומביה הבריטית)
event date icon
יום חמישי, 2.9.2010, 14:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
The talk addresses the analysis of multi-spectral retinal image sets and hyperspectral satellite images. Pixels in such image sets represent mixtures of pure substances, called endmembers. The linear mixture model for hyperspectral imaging assumes that each pixel is a linear combination of the spectra of a collection of endmembers. To demix each pixel, these endmembers must be identified. A novel parallel algorithm to extract endmembers and demix each pixel is presented. Typical algorithms for endmember ...
[לנוסח המלא]
Pixel Club Seminar: Reconstruction of the Brain Using High-Throughput Microscopy: Imaging, Segmentation, and Visualization
event speaker icon
ג'ון קייזר (אונ' A&M בטקסס)
event date icon
יום שני, 30.8.2010, 10:00
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Recent advances in microscopy have enabled the collection of large amounts of microscopic data at rapid rates. The size and rate of acquisition of these "high throughput" microscopic data sets present new opportunities in understanding the structure and function of organs, but also present new challenges in the processing, analysis, and visualization of the data. This talk will describe some of the challenges and opportunities coming from an effort to reconstruct the mouse brain. This ...
[לנוסח המלא]
An effective method for parameter estimation with PDE constraints with multiple right hand sides
event speaker icon
Eldad Haber SPECIAL LECTURE
event date icon
יום ראשון, 29.8.2010, 14:30
event location icon
חדר 337-8 טאוב.
Haifux, Haifa Linux Club: HTML5 - The Next Generations of the Web
event speaker icon
צפריר ריהן
event date icon
יום שני, 16.8.2010, 18:30
event location icon
טאוב 6
Since 2004, the Web Hypertext Application Technology Working Group (WHATWG) has been working on the next generation of HTML, the markup that makes up web documents. In this talk, we will dive into some of the new elements defined by HTML5, see examples of how behavior that used to require third party software can now be implemented using web standards, discuss the evolution of HTML, and explore the options of developing fully featured applications on ...
[לנוסח המלא]
סמינר פיקסל קלאב: מדידה וניתוח של תהליך ההסתגלות לאותות אופטיים ברשתית הביולוגית
event speaker icon
גיל ריבנאי (הנדסת חשמל, הטכניון)
event date icon
יום שלישי, 10.8.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
רשתית העין היא הרקמה העצבית הראשונה המעבדת את המידע החזותי במערכת הראיה הביולוגית. בעבודה זאת נערכו ניסויי מעבדה בהם נבדקה תגובת רשתית חיה מתוך נקודת מבט מרחבית על-ידי מדידה בו זמנית במספר רב של נקודות באמצעות מערך אלקטרודות. תחילה נבדק מהו משך הגירוי האופטימאלי המוביל לתגובה מקסימאלית, ומהו קבוע הדעיכה של הסתגלות הרשתית. כמו כן נמדד זמן התגובה של הרשתית עבור אותו עירור אופטימאלי. נבדקה סדרה של גירויים השונים במשכם וכן במשך ההתאוששות, כך שניתן ...
[לנוסח המלא]
Pixel Club Seminar: Rich Photography on a Budget
event speaker icon
סם חסינוף (MIT, CSAIL)
event date icon
יום רביעי, 4.8.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Computation is playing an increasingly central role in how we capture and process our images, opening up richer forms of photography that go beyond conventional imaging. Recent examples include merging multiple shots to obtain seamless panoramas, 3D shape, deeper focus, or a wider range of tones. In this talk, I will argue that the future of photography lies in richer capture, paying special attention to our limited budget of light, time, and sensor throughput. By ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Zemereshet - An Emergency Project for the Rescue and Electronic Documentation of Early Hebrew Music
event speaker icon
יאיר אבן-זוהר (הטכניון)
event date icon
יום שני, 2.8.2010, 18:30
event location icon
טאוב 6
Zemereshet is an Emergency Project for the Rescue and Electronic Documentation of Early Hebrew Music. It is a volunteer association of enthusiasts who have assumed the mission of preserving the songs that were written and sung in Hebrew from the beginning of the Zionist movement until the establishment of the State of Israel. To that end, they established a website with thousands of recordings, lyrics, and complementary information. Yair Even-Zohar's talk will present the project ...
[לנוסח המלא]
Topics in over-parametrized based variational methods
event speaker icon
שחר שם-טוב
event date icon
יום רביעי, 28.7.2010, 11:30
event location icon
טאוב 337
We discuss a variational methodology, which involves locally modeling of data from noisy samples, combined with global model parameter regularization. We show that this methodology encompasses many previously proposed algorithms, from the celebrated moving least squares methods to the globally optimal over-parametrization methods recently published for smoothing and optic flow estimation. However, the unified look at the range of problems and methods previously considered also suggests a wealth of novel global functionals and local modeling ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Valgrind - From Magic to Science
event speaker icon
שחר ריינדל (הנדסת חשמל, הטכניון))
event date icon
יום שני, 26.7.2010, 18:30
event location icon
טאוב 6
Valgrind is an extremely powerful development tool, which detects and pin-points many common programming errors when running a program. Some examples for the problems it handles are many kinds of buffer overflows, using uninitialized data, accessing freed memory and memory leaks. Valgrind does that without need for recompilation of the program, simply by adding "valgrind" to the beginning of the command line. To an outside observer, this could seem like magic. In this lecture, we ...
[לנוסח המלא]
Pixel Club Seminar: Compressed Sensing for Hyperspectral Imaging
event speaker icon
אודי פפר (מדעי המחשב, הטכניון)
event date icon
יום רביעי, 14.7.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We introduce a system for hyperspectral imaging based on micro-mirror array, that projects subsets of image pixels onto a prism (or diffraction grating), followed by a CCD-type sensor. This system allows generalized sampling schemes including compressed sensing. We acquire only a fraction of the samples that are required to obtain the full-resolution signal (hyperspectral cube in our case), and by means of non-linear optimization recover the underlying signal. We use a prior knowledge about the ...
[לנוסח המלא]
Finding and Localizing Bugs in Dynamic Web Applications
event speaker icon
Shay Artzi
event date icon
יום ראשון, 11.7.2010, 14:30
event location icon
חדר 337-8 טאוב.
Haifux, Haifa Linux Club: GarlicSim: An Experimental Tool for Computer Simulations
event speaker icon
רם רחום (GarlicSim)
event date icon
יום שני, 5.7.2010, 18:30
event location icon
טאוב 6
GarlicSim is an ambitious open-source project in the field of scientific computing, specifically computer simulations. It attempts to redefine the way that people think about computer simulations, making a new standard for how simulations are created and used. GarlicSim is a platform for writing, running and analyzing simulations. It is general enough to handle any kind of simulation: Physics, game theory, epidemic spread, electronics, etc. You may be wondering, what do these simulations have in ...
[לנוסח המלא]
CGGC Seminar: A Multi-Resolution Approach to Heat Kernels on Discrete Surfaces
event speaker icon
אמיר וקסמן (מדעי המחשב, הטכניון)
event date icon
יום ראשון, 4.7.2010, 13:00
event location icon
חדר 337, בניין טאוב למדעי המחשב
Studying the behavior of the heat diffusion process on a manifold is emerging as an important tool for analyzing the geometry of the manifold. Unfortunately, the high complexity of the computation of the heat kernel - the key to the diffusion process - limits this type of analysis to 3D models of modest resolution. We show how to use the unique properties of the heat kernel of a discrete two dimensional manifold to overcome these ...
[לנוסח המלא]
Probabilistic Methods in Distributed Computing
event speaker icon
קרן צנזור-הלל
event date icon
יום רביעי, 30.6.2010, 14:30
event location icon
טאוב 601
An inherent characteristic of distributed systems is the lack of centralized control, which requires the components to coordinate their actions. This need is abstracted as the \emph{consensus} problem, in which each process has a binary input and should produce a binary output, such that all outputs agree. A difficulty in obtaining consensus arises from the possibility of process failures in practical systems. When combined with the lack of timing assumptions in asynchronous systems, it renders ...
[לנוסח המלא]
Complex Barycentric Coordinates with Applications to Planar Shape Deformation and Interpolation
event speaker icon
אופיר ובר
event date icon
יום רביעי, 30.6.2010, 11:00
event location icon
טאוב 401
Barycentric coordinates are heavily used in computer graphics applications to generalize a set of given data values. Traditionally, the coordinates are required to satisfy a number of key properties, the first being that they are real. In this work we relax this requirement, allowing the barycentric coordinates to be complex numbers. This allows us to generate new families of barycentric coordinates, which have some powerful advantages over traditional ones and are especially useful for creating ...
[לנוסח המלא]
LOCATION, LOCATION, LOCATION: CASTING A WIDE NET ON GEOGRAPHIC INFORMATION SYSTEMS (GIS)
event speaker icon
Hanan Samet
event date icon
יום שלישי, 29.6.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Incorporating Temporal Context in Bag-of-Words Models
event speaker icon
תמר בק (הנדסת חשמל, הטכניון)
event date icon
יום שלישי, 29.6.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
The Bag-of-Words (BoW) model is often used for recognition of objects, scenes, actions and more. It achieves impressive results in many diff erent areas, although it discards the spatial and temporal order of codewords in a labeled signal. This work is defi ning a new model: Contextual Sequence of Words (CSoW) which incorporates temporal order in a BoW model for video representation, and tests it on action recognition tasks. The temporal context is incorporated in ...
[לנוסח המלא]
Cross Layer Networking and Management for Mobile Wireless Networks
event speaker icon
Distinguished Professor Izhak Rubin
event date icon
יום חמישי, 24.6.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: What is a Cluster? Perspectives from Game Theory
event speaker icon
מרצ'לו פלילו (אוניברסיטת ונציה, איטליה)
event date icon
יום חמישי, 24.6.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Contrary to the vast majority of approaches to clustering, which view the problem as one of partitioning a set of observations into coherent classes, thereby obtaining the clusters as a by-product of the partitioning process, we propose to reverse the terms of the problem and attempt instead to derive a rigorous formulation of the very notion of a cluster. In our endeavor to provide an answer to this question, we found that game theory offers ...
[לנוסח המלא]
Pixel Club Seminar: Non-parametric Atlas-Based Segmentation of Highly Variable Anatomy
event speaker icon
פולינה גולנד, MIT/CSAIL
event date icon
יום רביעי, 23.6.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
We propose a non-parametric probabilistic model for the automatic segmentation of medical images. The resulting inference algorithms register individual training images to the new image, transfer the segmentation labels and fuse them to obtain the final segmentation of the test subject. Our generative model yields previously proposed label fusion algorithms as special cases, but also leads to a new variant that aggregates evidence locally in determining the segmentation labels. We demonstrate the advantages of our ...
[לנוסח המלא]
Large networks, Communities and Kronecker Products
event speaker icon
Jure Leskovec
event date icon
יום שלישי, 22.6.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Color Video Coding using Spatio-Temporal Correlation of Primary Colors
event speaker icon
רודי פרימורק (הנדסת חשמל, הטכניון)
event date icon
יום שלישי, 22.6.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Natural videos, given in the RGB color space, are characterized by high correlations between the primary colors (R, G and B). To reduce this redundancy, most video compression algorithms, like MPEG, decorrelate the color components by transforming the input video from the highly correlated RGB components into less correlated space such as YIQ or YCbCr. In this work, we propose a different approach, which utilizes the natural high inter-color correlation. We have developed algorithms for ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Technological Challanges in Ben Yehuda Project
event speaker icon
אסף ברטוב (פרוייקט בן-יהודה, יו"ר העמותה למיחשוב ספרות עברית)
event date icon
יום שני, 21.6.2010, 18:30
event location icon
טאוב 6
פרוייקט בן-יהודה הוא מיזם התנדבותי אשר בונה ומתחזק מאגר חופשי של יצירה עברית שאינה מוגנת בזכויות יוצרים. המהדורות האלקטרוניות של היצירות מוגשות לציבור בחינם, ללא פרסומות, והן נחלת הכלל (public domain), וזמינות לכל שימוש, לרבות שימוש מסחרי. על אף המראה הבסיסי והמיושן של האתר הנוכחי, יש עבודה רבה מאחורי הקלעים, והתמודדות עם כמה אתגרים, טכנולוגיים ואחרים, שעל מקצתם אדבר. סקירת תוכן ההרצאה: - היכרות עם פרוייקט בן-יהודה ואופן פעולתו - סקירה טכנית של האתר הנוכחי ...
[לנוסח המלא]
Analysis and Detection of Interactions Among Aspects
event speaker icon
אמיליה כץ
event date icon
יום ראשון, 20.6.2010, 12:30
event location icon
טאוב 701
Aspect-oriented programming is becoming a common approach to extend object systems with modules that cross-cut the usual class hierarchy. Aspects encapsulate treatment of concerns that otherwise would be scattered within an underlying application, and tangled with code treating other concerns. Often, insertion of several aspects into one system is desired and in that case the problem of interference among the aspects might arise, even if each aspect individually woven is correct relative to its specification. ...
[לנוסח המלא]
Pixel Club Seminar: Whole-Body Robot Sensing Is Prerequisite for Human-Robot Interaction and Teams
event speaker icon
ולדימיר לומלסקי (אונ' נאס"א, מרילנד)
event date icon
יום ראשון, 20.6.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
While control via sensing in robotics and in human-robot interaction is important for both robot autonomous vehicles and arm manipulators, it is more prescient and less understood in robot arm manipulation tasks. Analysis of such systems suggests the following: * Mutual safety of humans vis-a-vie robots vis-a-vie other objects in an unstructured environment dictates a need for massive coverage of the whole robot body with sensors. * Achieving robot motion planning skills sufficient for an ...
[לנוסח המלא]
CGGC Seminar: Visualizing R^N – Representing Surfaces by their Normal Vectors
event speaker icon
אלפרד אינסלברג (מתמטיקה, אונ' ת"א)
event date icon
יום ראשון, 20.6.2010, 11:00
event location icon
טאוב 401
With parallel coordinates the perceptual barrier imposed by our 3-dimensional habitation is breached enabling the visualization of multidimensional problems. By learning to recognize patterns a powerful knowledge discovery process evolved. It leads to a deeper geometrical insight: the recognition of M-dimensional objects recursively from their (M-1)-dimensional subsets. A hyperplane in N-dimensions is represented by (N -1) indexed points. Points representing lines have two indices, those representing planes three indices and so on. In turn, this ...
[לנוסח המלא]
A Brief History of the Internet
event speaker icon
Distinguished professor Leonard Kleinrock
event date icon
יום רביעי, 16.6.2010, 14:30
event location icon
EE Meyer Building 861
Online reconstruction of 3D objects from arbitrary cross-section data
event speaker icon
עמית ברמנו
event date icon
יום רביעי, 16.6.2010, 11:00
event location icon
טאוב 337
The reconstruction of a surface from a set of planar cross-sections such that the surface interpolates, or approximates, the input has been thoroughly studied in the past decades. This problem arises mainly in the fields of medical imaging (MRI, CT, ultrasound etc.) and geographical information systems (for terrain reconstruction). The input is assumed to have been segmented in a preprocessing step, to create a set of closed two-dimensional contours, separating the
[לנוסח המלא]
My Life and My Work
event speaker icon
Distinguished professor Leonard Kleinrock
event date icon
יום שלישי, 15.6.2010, 14:30
event location icon
חדר 337-8 טאוב.
יום עיון בקריפטולוגיה 2010
event speaker icon
יום עיון בקריפטולוגיה
event date icon
יום רביעי, 9.6.2010, 13:30
event location icon
טאוב 1
יום העיון בקריפטולוגיה 2010 יתקיים ביום ד', 9 ביוני 2010, בין השעות 9.00-16.10, באודיטוריום 1, בניין טאוב למדעי המחשב, הטכניון. כולם מוזמנים. פרטים נוספים ותוכנית
[לנוסח המלא]
Bioinformatics Forum: Useful Tools in Finding Genetic Determinants of Complex Traits: Quantitative Genetic Analysis Software and Bioinformatics Resources for Marker Prioritization.
event speaker icon
דר' סרגי ארמקוב (הפק' לרפואה, אונ' תל-אביב)
event date icon
יום רביעי, 9.6.2010, 13:30
event location icon
טאוב 701
Substantial familial aggregation and heritability is observed for a wide range of phenotypes in general human population. Much effort has been made to decipher which specific genetic factors contribute to normal interindividual variability and development of pathologic conditions. The lecture will focus on the workflow of a typical family-based genetic research, illustrated by the association study of RUNX2 polymorphisms and hand bone length and BMD, relevant to osteoporosis. The Program Package MAN for pedigree analysis ...
[לנוסח המלא]
Pixel Club Seminar: "Good" Computation for the Motion of Colliding Objects
event speaker icon
איתן גרינספון (מדעי המחשב, אוניברסיטת קולומביה)
event date icon
יום רביעי, 9.6.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We would like to compute the motion of flexible materials colliding against each other in complex ways (e.g., sheets of fabric being knotted, plastic and metal containers crushed in a trash compactor). Such computations are needed in special effects, engineering design, medical simulation, and any other domain that requires consideration of materials interacting against each other. What is a "good" way to carry out such computations? What sets our approach apart from previous attempts is ...
[לנוסח המלא]
Bioinformatics Forum: Accurate Protein Function Prediction with the GOstruct Method
event speaker icon
אסא בן-חור (מדעי המחשב, אונ' קולורדו)
event date icon
יום רביעי, 9.6.2010, 11:00
event location icon
טאוב 701
Protein function prediction is an active area of research in bioinformatics. And yet, transfer of annotation on the basis of sequence or structural similarity remains widely used in practice. Most of the machine learning methods applied to this problem reduce it to a collection of binary classification problems: whether a protein performs a particular function, sometimes with a post-processing step to combine the binary outputs. I will present the GOstruct method that directly predicts the ...
[לנוסח המלא]
Regret Minimization and Job Scheduling
event speaker icon
Yishay Mansour - Annual S. Even Distinguished Colloquium
event date icon
יום שלישי, 8.6.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Nash, Burago & Zalgaller and Image Processing
event speaker icon
אמיל סוקן (מתמטיקה, טכניון)
event date icon
יום שלישי, 8.6.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
The celebrated Nash Embedding Theorem is extensively employed in recent years in various theoretical, as well as practical, aspects of Computer Graphics and Image Processing. However, in practice, this kind of application encounters certain obstructions, rendering the use of the Embedding Theorem as somewhat problematic. We explore therefore its practicability in Vision, Graphics and other Imaging sciences. As a solution for some of the problems mentioned above, the use of a PL version of the ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Gupta et al.'s paper (and work) on Difference Engine.
event speaker icon
אורנה אגמון בן-יהודה (מדעי המחשב, הטכניון)
event date icon
יום שני, 7.6.2010, 18:30
event location icon
טאוב 6
Difference Engine is an extension to Xen, which is an open-source hypervisor. The paper, titled "Difference Engine: Harnessing Memory Redundancy in Virtual Machines", by Diwaker Gupta, Sangmin Lee,Michael Vrable, Stefan Savage, Alex C. Snoeren, George Varghese, Geoffrey M. Voelker, and Amin Vahdat, won a best paper award in OSDI'08. I will not present the conference talk (which is just a taste, and for which slides are unavailable) but the full paper, including my comments on ...
[לנוסח המלא]
CGGC Seminar: A Polynomial Root Solver that preserves The Multiplicities of the Roots
event speaker icon
יואב וינקלר (אונ' שפילד, אנגליה)
event date icon
יום חמישי, 3.6.2010, 13:00
event location icon
חדר 337, בניין טאוב למדעי המחשב
Bioinformatics Forum: Deriving Enzymatic and Taxonomic Signatures of Metagenomes from Short Read Data
event speaker icon
פרופ' דוד הורן (ביה"ס לפיסיקה ואסטרונומיה, אונ' ת"א)
event date icon
יום רביעי, 2.6.2010, 13:30
event location icon
טאוב 701
We propose a method for deriving enzymatic signatures from short read (SR) metagenomic data of unknown species. The SR data are converted to six pseudo-peptide candidates. We search for occurrences of Specific Peptides (SPs) on the latter. SPs are peptides that are indicative of enzymatic function as defined by the Enzyme Commission (EC) nomenclature. Counting their hits, we associate short reads with specific EC categories. The putative peptide counts can then be converted to estimates ...
[לנוסח המלא]
From Philosophical to Industrial Logics
event speaker icon
Moshe Y. Vardi
event date icon
יום שלישי, 1.6.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Inverse Source Problems in Domains with Holes
event speaker icon
ריצ'רד טסאי (מתמטיקה, אונ' טקסס)
event date icon
יום שלישי, 1.6.2010, 14:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We consider the inverse problem of discovering the location of point sources from very sparse point measurements in a bounded domain that contains impenetrable (and possibly unknown) obstacles. We present our adaptive algorithm for determining the measurement locations, and ultimately, the source locations.
[לנוסח המלא]
Pixel Club Seminar: Audio - Visual Fusion
event speaker icon
ראדו הוראד (INRIA צרפת)
event date icon
יום שלישי, 1.6.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Pixel Club Seminar: 3D Shape Representation Using Diffusion Embeddings
event speaker icon
ראדו הוראד (INRIA צרפת)
event date icon
יום שני, 31.5.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We will address the problem of representing shapes using eigenvalues and eigenvectors of the discrete diffusion operator. A discrete shape, such as a mesh or a point cloud, can be viewed as an undirected weighted graph, hence one can use spectral graph theory to both embed and analyse shapes. We propose two graph diffusion operators that are built based on two widely used graph Laplacians: The combinatorial Laplacian and the normalized Laplacian. We recapitulate the ...
[לנוסח המלא]
Mathematics Club Seminar: Metric Geometry in Action
event speaker icon
רון קימל (מדעי המחשב, הטכניון)
event date icon
יום רביעי, 26.5.2010, 16:30
event location icon
אמאדו 232
More detail in seminar poster פרטים נוספים
[לנוסח המלא]
Privacy Preserving Data Mining
event speaker icon
אריק פרידמן
event date icon
יום רביעי, 26.5.2010, 14:00
event location icon
טאוב 601
In recent years the data mining community has faced a new challenge. Having shown how effective its tools are in revealing the knowledge locked within huge databases, it is now required to develop methods that restrain the power of these tools to protect the privacy of individuals. This research focuses on the problem of guaranteeing privacy of data mining output. In the talk I will present some of the recent research results. We consider the ...
[לנוסח המלא]
Computational Metric Geometry: A New Tool in Image Sciences
event speaker icon
Michael Bronstein
event date icon
יום שלישי, 25.5.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: On the Role of Color Information in Image Processing and Visual Communication
event speaker icon
יבגני גרשיקוב (טכניון)
event date icon
יום שלישי, 25.5.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Color information plays a major role in image processing and visual communication although presently most algorithms and tools are developed mainly for monochromatic images. Usually, the processing of color images is performed either in the RGB color space or in another color space chosen rather arbitrarily, such as YUV or YIQ. In this work we propose new frameworks for color image processing and coding based on an optimized approach. These frameworks along with rate-distortion analysis ...
[לנוסח המלא]
Haifux, Haifa Linux Club: KDE 4 - The Good, The Bad, and The Broken
event speaker icon
דותן כהן (טכניון)
event date icon
יום שני, 24.5.2010, 18:30
event location icon
טאוב 6
KDE was developed to give Unix applications a common look and feel. From 1996 to 2007 the desktop environment saw many improvements and changes. In January 2008 a rewrite of the entire desktop environment and many of it's core applications was performed. The rewrite, called KDE 4, led to a dramatic change in KDE's stance. Once noted for its configurablity, KDE 4 had significantly fewer options than previous KDE versions. Core applications and the desktop ...
[לנוסח המלא]
Oblivious and Cost Aware Distributed Load Sharing in the Cloud
event speaker icon
Danny Raz
event date icon
יום שלישי, 11.5.2010, 14:30
event location icon
חדר 337-8 טאוב.
Haifux, Haifa Linux Club: Compromising Electromagnetic Emanations of Wired and Wireless Keyboards
event speaker icon
רועי מגדל
event date icon
יום שני, 10.5.2010, 18:30
event location icon
טאוב 6
Roy Migdal will present the work of Martin Vuagnoux and Sylvain Pasini, which won the best paper award at 18th USENIX Security Symposium (Usenix Security '09), Montreal, Canada, August 10-14, 2009. Computer keyboards are often used to transmit confidential data such as passwords. Since they contain electronic components, keyboards eventually emit electromagnetic waves. These emanations could reveal sensitive information such as keystrokes. The technique generally used to detect compromising emanations is based on a wide-band ...
[לנוסח המלא]
Pixel Club Seminar: Non-Rigid Shape Correspondence by Matching Semi-Local Spectral Features and Global Geodesic Structures
event speaker icon
אנסטסיה דוברובינה (הנדסת חשמל, הטכניון)
event date icon
יום שני, 10.5.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Non-rigid shape correspondence by matching semi-local spectral features and global geodesic structures Abstract: We present an efficient computational method for finding correspondences between non-rigid shapes. It utilizes both pointwise surface descriptors, and metric structures defined on the shapes to perform the matching task, which is formulated as a quadratic minimization problem. The suggested surface descriptors are based on eigendecomposition of the Laplace-Beltrami operator. It is also observed that when using the above descriptors, multiple possible ...
[לנוסח המלא]
Bitonic Sorters Of Minimal Depth
event speaker icon
תמיר לוי
event date icon
יום רביעי, 5.5.2010, 14:30
event location icon
טאוב 601
A Bitonic sorter is a comparator network that sorts every Bitonic input sequence. In our research, we studied the minimal depth of such networks. Building on previous works, we establish that the minimal depth of a Bitonic sorter of n keys is 2ceiling(log(n)) -floor(log(n)). This result is constructive - that is, we present, for every n, a Bitonic sorter of that depth. In this talk I will also present other results from my PhD research.
[לנוסח המלא]
The Identification of Join Candidates in the Cairo Genizah: An interdisciplinary challenge in computer assisted text processing
event speaker icon
Lior Wolf
event date icon
יום שלישי, 4.5.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar:
נחילים – מעולם הטבע לעולם ההנדסה – מה ניתן ללמוד מהטבע
event speaker icon
אריק יבנאי
event date icon
יום שלישי, 4.5.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
חקירה והתבוננות בעולם הטבע חוללה תובנות רבות בקרב החוקרים. נחילים בטבע, כמו גם בעלי חיים החיים בקבוצות שיתופיות, מציגים יכולות מרשימות בהשגת יעדים קבוצתיים, גם אם יכולות הפרטים בקהילה מוגבלות למדי. התמודדות עם בעיות מורכבות מדרבנת את החיפוש אחר פתרונות הכרוכים בהפעלה של מערכים הנדסיים מרובי כלים – "נחילים הנדסיים". מטרתם היא השגת יעדים משותפים תוך התמודדות עם סביבות לא מוכרות, אי-וודאויות, דינמיקה של אירועים, והפתעות תרחיש. ההרצאה תציג תובנות מהטבע, את המוטיבציה לפיתוח מערכות ...
[לנוסח המלא]
Pixel Club Seminar: Theory and Algorithms for Anisotropic Triangulations with Applications to Image Representations
event speaker icon
אלברט כהן (אונ' פריס)
event date icon
יום רביעי, 28.4.2010, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
We present the first results of an ongoing project revolving around approximation by finite element functions on adaptive and anisotropic triangulations, with application to image processing. We first recall the available theory for isotropic triangulations which involves Besov-Sobolev spaces. For anisotropic triangulations, we present an analytic criterion that governs the rate of convergence in Lp norms for optimally adapted triangulations. We propose a greedy algorithm which has the ability to generate triangulations that exhibit a ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Making the Internet Accessible - workshop
event speaker icon
אור דונקלמן (מכון ויצמן למדע)
event date icon
יום שני, 26.4.2010, 18:30
event location icon
טאוב 6
In this meeting we shall try and contact as many webmasters of as many websites that do not support Linux-based browsing (as well as OpenSource browsing in other OSes). The aim is to offer a great deal of "demand" to various websites, thus proving the importance of supporting wide range of platforms (and following the internet standards). Before the meeting, we shall have a list of websites and the contact details of the webmasters (including ...
[לנוסח המלא]
Bioinformatics Forum: An Algorithmic Framework for Predicting Side-Effects of Drugs
event speaker icon
ניר אטיאס (מדעי מחשב, אונ' ת"א)
event date icon
יום רביעי, 21.4.2010, 14:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
One of the critical stages in drug development is the identification of potential side effects for promising drug leads. Large scale clinical experiments aimed at discovering such side effects are very costly and may miss subtle or rare side effects. To date, and to the best of our knowledge, no computational approach was suggested to systematically tackle this challenge. In this work we report on a novel approach to predict the side effects of a ...
[לנוסח המלא]
Movement Problems
event speaker icon
Daniel Marx
event date icon
יום שלישי, 13.4.2010, 14:30
event location icon
חדר 337-8 טאוב.
Haifux, Haifa Linux Club: Genetic Algorithms
event speaker icon
עומר בוהם
event date icon
יום שני, 12.4.2010, 18:30
event location icon
טאוב 6
Theory Seminar: A Thermodynamic Approach to the Analysis of Multi-Robot Cooperative Localization under Independent Errors
event speaker icon
יותם אלאור (מדעי המחשב, הטכניון)
event date icon
יום רביעי, 7.4.2010, 12:30
event location icon
טאוב 201
Abstract: We propose a new approach to the simultaneous cooperative localization of a group of robots capable of sensing their own motion and the relative position of nearby robots. In the last decade, the use of distributed optimal Kalman filters (KF) to solve this problem have been studied extensively. In this paper, we propose to use a sub-optimal Kalman filter (denoted by EA). EA requires significantly less computation and communication resources then KF. Furthermore, in ...
[לנוסח המלא]
Online Set Packing and Competitive Scheduling of Multi-Part Tasks
event speaker icon
Dror Rawitz
event date icon
יום שלישי, 6.4.2010, 14:30
event location icon
חדר 337-8 טאוב.
The security tower of Babel
event speaker icon
Yuri Gurevich
event date icon
יום חמישי, 25.3.2010, 14:30
event location icon
חדר 337-8 טאוב.
Model Checking Using Tree-width Methods: Old and New
event speaker icon
Isolde Adler SPECIAL LECTURE note unusual hour
event date icon
יום חמישי, 18.3.2010, 11:30
event location icon
חדר 601 טאוב.
Code Structures in Java
event speaker icon
איתי ממן
event date icon
יום רביעי, 17.3.2010, 14:30
event location icon
טאוב 601
This research explores the identification of recurring constructs, Code Structures, which serve as the building blocks of object oriented programs and the exploitation of these in various areas including software research, development tools, and language design. Any in-depth research of these structures, be it an empirical study of existing programs or an analytical reasoning about software modules, must be based on some formal means for describing the elements of a program. To this end we ...
[לנוסח המלא]
Theory Seminar: On the Degree of Symmetric Functions on the Boolean Cube
event speaker icon
גיל כהן (מדעי המחשב, הטכניון)
event date icon
יום רביעי, 17.3.2010, 12:30
event location icon
טאוב 201
In the 1997 paper "Polynomials with two values" by von zur Gathen and Roche (Combinatorica), the authors proved that the degree of any non-constant symmetric function of the form $f:{0,1}^n \rightarrow {0,1}$ is $n-o(n)$ (where the degree of a function is defined to be the degree of the unique interpolation polynomial, of degree at most $n$, of the function). In their proof, the authors heavily used the fact that the function is Boolean. The authors ...
[לנוסח המלא]
Fixed-parameter algorithms for graph separation problems
event speaker icon
Igor Razgon
event date icon
יום שלישי, 16.3.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Computational Aesthetics - Science or Art?
event speaker icon
אוליבר דאוסן (אונ' קונסטנץ, גרמניה)
event date icon
יום שלישי, 16.3.2010, 11:30
event location icon
EE Meyer Building 1061
Apart from rendering photorealistic images many works in computer graphics focus on creating illustrative and artistic images. Such images can be used in many contexts ranging from CAD to planning and technical documentation. Finding mathematical principles and algorithms for aesthetic configurations is one important aspect for producing good illustrations. The talk will give an overview about this fascinating field between art and science, many examples will illustrate how close compuational outputs come to what artists ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Scientific Programming with Modern Fortran
event speaker icon
שמעון פנפיל (Ph.D.)
event date icon
יום שני, 15.3.2010, 18:30
event location icon
טאוב 8 (מיקום שונה)
Fortran is the most known language for scientific and engineering problems. However growth of popularity of C/C++,Java, Matlab etc has shadowed the development and mere existence of Fortran from wider community. Situation may change know. Fortran 2003 standard provides all language features, one expects from modern programming language and gfortran which replaced g77 in gcc starting from version 4.0 implements this standard. Slides are already available. .
[לנוסח המלא]
Bioinformatics Forum: An Universal Adaptive Translation Efficiency Profile of Proteins
event speaker icon
צחי פלפל (מכון ויצמן למדע)
event date icon
יום שני, 15.3.2010, 14:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Recent years have seen intensive progress in measuring protein translation. However, the contributions of coding sequences to the efficiency of the process remain unclear. Here, we identify a universally conserved profile of translation efficiency along mRNAs computed based on adaptation between coding sequences and the tRNA pool. In this profile, the first ~30-50 codons are, on average, translated with a low efficiency. Additionally, in eukaryotes, the last ~50 codons show the highest efficiency over the ...
[לנוסח המלא]
Theory Seminar: Non-Preemptive Buffer Management for Latency Sensitive Packets
event speaker icon
מורן פלדמן (מדעי המחשב, הטכניון)
event date icon
יום רביעי, 10.3.2010, 12:30
event location icon
טאוב 201
The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes useless if it arrives after its deadline. The deadline, however, applies only to the packet's journey through the entire network; individual routers along the packet's route face a more flexible deadline. We consider policies for admitting latency sensitive packets at a router. Each packet is tagged with ...
[לנוסח המלא]
Property Testing and its application in databases
event speaker icon
Eldar Fischer
event date icon
יום שלישי, 9.3.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Shape-constrained Graph Min-cut approach for Medical Image Segmentation
event speaker icon
מוטי פרימן (מדעי המחשב, האונ' העברית בי-ם)
event date icon
יום שלישי, 9.3.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Segmentation of organs and vascular structures from clinical Computed Tomography (CT) images is a crucial task in many clinical applications including diagnosis, patient specific training simulations, and intra-operative navigation. The segmentation is a challenging task due to the unclear distinction between the required structure and its surrounding tissue, artifacts in the CT images, and the presence of pathologies. We present a shape constrained graph min-cut approach for the segmentation. Discrete energy functions are defined with ...
[לנוסח המלא]
CGGC Seminar: 3D Surface Reconstruction Using A Generalized Distance Function
event speaker icon
רועי פורן (מדעי המחשב, הטכניון)
event date icon
יום ראשון, 7.3.2010, 13:00
event location icon
חדר 337, בניין טאוב למדעי המחשב
3D scanning is the process of acquiring a digital copy of a physical object. A 3D scanner is used to sample points on the surface of the object (the so-called underlying surface) and acquire their Cartesian coordinates, after which a surface reconstruction algorithm is applied to generate a surface based on this sample set. We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct ...
[לנוסח המלא]
On the Performance of Dijkstra's 3rd Self-stabilizing Algorithm for Mutual Exclusion and Related Algorithms
event speaker icon
ויאצ'סלב צ'רנוי
event date icon
יום רביעי, 3.3.2010, 14:00
event location icon
טאוב 601
In a paper of 1974 Dijkstra introduced the notion of self-stabilizing algorithms and presented three such algorithms for the problem of mutual exclusion on a ring of $n$ processors. The third algorithm is the most interesting of these three but is rather non intuitive. In 1986 a proof of its correctness was presented by Dijkstra, but the question of determining its worst case complexity --- that is, providing an upper bound on the number of ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Drupal
event speaker icon
מיכאל שמילוב, יוני לימור (yam-design) וישראל דוד
event date icon
יום שני, 1.3.2010, 18:30
event location icon
טאוב 6
Drupal is an open source content management system that developed into a web application framework written in PHP, it is used to build a wide variety of high-profile web sites, including open source projects like the Linux Journal, online news publishers like The New York Observer , and social networking communities like MTV UK. The talk will begin with an overview of Drupal: its capabilities and its usage profile. Some ready-to-use Drupal full-blown installs will ...
[לנוסח המלא]
IE Student M.Sc. Seminar: Optimizing the Size of Software Inspection Teams
event speaker icon
אלכסנדר רג'ינסקי (הנדסת תעשייה וניהול)
event date icon
יום שלישי, 23.2.2010, 11:00
event location icon
טאוב 701
Code inspection is considered to be an efficient method for detecting some kinds of faults in software code documents. Other kinds of faults are more efficiently detected by other methods such as testing. It has therefore been suggested first to inspect the code and thereafter test it. The number of inspectors employed in the inspection should be determined to enable detection of most of the faults that inspection detects efficiently. The faults detected by the ...
[לנוסח המלא]
Learning from Multiple Teachers
event speaker icon
Ofer Dekel
event date icon
יום חמישי, 18.2.2010, 14:30
event location icon
חדר 337-8 טאוב.
Abstractions for devising compact controllers for MDPs
event speaker icon
קולמן וורנוביצקי
event date icon
יום רביעי, 17.2.2010, 15:30
event location icon
טאוב 601
Planning a course of action is a key ability for intelligent systems. It involves the representation of actions and world models, reasoning about the effects of actions, and techniques for efficiently searching the space of possible plans. Planning under uncertainty is captured by the area of decision-theoretic planning (DTP). In such problems, the actions have stochastic effects, and the goal is to devise a policy of acting with a high expected utility, as opposed to ...
[לנוסח המלא]
Cryptography by the People, for the People: How Voting and Cryptography Go Hand-in-Hand
event speaker icon
Tal Moran
event date icon
יום שלישי, 16.2.2010, 14:30
event location icon
חדר 337-8 טאוב.
Haifux, Haifa Linux Club: VoIP in Linux
event speaker icon
רמי רוזן
event date icon
יום שני, 15.2.2010, 18:30
event location icon
טאוב 6
VoIP is an emerging and exciting technology. We will deal with the basics of VoIP protocols and we will discuss some Linux VoIP applications. We will also discuss VOIP with cellular phones (like Android). VOIP protocols:- RTP - Real Time protocol. - RTCP - Real Time control protocol.   Codecs (audio and video): - SIP -the Session Initiation Protocol.   --Sip Requests and Sip Responses.   --The INVITE, REGISTER and Byerequests.   SIP clients and ...
[לנוסח המלא]
Optimal Network Locality in Distributed Services
event speaker icon
Gwendal Simon SPECIAL TALK
event date icon
יום שני, 15.2.2010, 14:30
event location icon
חדר 337-8 טאוב.
Theory Seminar: The Strength of Parameterized Tree-like Resolution
event speaker icon
מסימו לאוריה (אונ' רומא)
event date icon
יום רביעי, 10.2.2010, 13:30
event location icon
טאוב 201
We examine the proof-theoretic strength of parameterized tree-like resolution---a proof system for the $\co\W[2]$-complete set of parameterized tautologies. Parameterized resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider (FOCS'07). In that paper, Dantchev et al.\ show a complexity gap in parameterized tree-like resolution for propositional formulas arising from translations of first-order principles. Here we pursue a purely combinatorial approach to obtain lower bounds to the proof size ...
[לנוסח המלא]
An online distributed system for genetic linkage analysis
event speaker icon
מרק זילברשטיין
event date icon
יום רביעי, 10.2.2010, 11:00
event location icon
טאוב 601
In this talk I will describe the algorithms and mechanisms underlying a distributed system for genetic linkage analysis, called Superlink-online. It is a production online system which serves hundreds of geneticists worldwide allowing for faster analysis of genetic data via automatic parallelization and execution on thousands of non-dedicated computers. I will describe the following innovative technologies forming the core of this system 1. Practical scheduling and execution of embarrassingly parallel Bags of Tasks in multiple ...
[לנוסח המלא]
Scalable Garbage Collection on Highly Parallel Platforms
event speaker icon
קטרינה ברבש
event date icon
יום רביעי, 3.2.2010, 14:00
event location icon
טאוב 601
Computing landscape is changing rapidly in the recent years. On the one hand, the pervasiveness of multiprocessor and multicore hardware requires the software to be able to take advantage of the increasingly available parallelism. On the other hand, the growing complexity of the modern software application domains makes runtime language environments more popular as a major software development tool. In this work, we investigate a question whether a garbage collector, being an important part of ...
[לנוסח המלא]
Computational methods for metagenomic analysis
event speaker icon
איתי שקד
event date icon
יום רביעי, 3.2.2010, 12:00
event location icon
חדר 4 (1st floor), טאוב
Metagenomics is a new field in which genetic material is extracted directly from the environment and is subsequently analyzed by a variety of biological and computational methods. Metagenomics makes it possible to study microbial communities directly from the environment and also to study microbial species that cannot be cultivated in the laboratory. Metagenomic data usually consists of many short (100-1,000 bp) DNA sequences, potentially originating from all organisms living in the examined environment. Several computational ...
[לנוסח המלא]
Haifux, Haifa Linux Club: Hspell - A Retrospective
event speaker icon
נדב הראל (י.ב.מ. מעבדות מחקר חיפה)
event date icon
יום שני, 1.2.2010, 18:30
event location icon
טאוב 6
Hspell is a free Hebrew spell checker. It is used by most Linux distributions, by free applications such as OpenOffice and Firefox, and even by Google's popular Gmail service. Seven years after Hspell's first release, it is a good occasion to look back and see what made it successful. We will review Hspell's design, how it was works, and how it was developed. We will ask ourselves what allowed Hspell to be developed quickly, what ...
[לנוסח המלא]
Computational Modeling and Algorithms in Molecular Evolution and Gene Translation
event speaker icon
Tamir Tuller
event date icon
יום חמישי, 28.1.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Shift-Map Image Editing
event speaker icon
יעל פריטש (מדעי המחשב והנדסה, האונ' העברית בירושלים)
event date icon
יום שלישי, 26.1.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Geometric rearrangement of images includes operations such as image retargeting, object removal, or object rearrangement. Each such operation can be characterized by a shift-map: the relative shift of every pixel in the output image from its source in an input image. We describe a new representation of these operations as an optimal graph labeling, where the shift-map represents the selected label for each output pixel. Two terms are used in computing the optimal shift-map: (i) ...
[לנוסח המלא]
Accelerating the TSUBAME Supercomputer with Graphics Processing Units and its Implications to Systems Research
event speaker icon
Naoya Maruyama
event date icon
יום ראשון, 24.1.2010, 14:30
event location icon
חדר 337-8 טאוב.
A Parallel Repetition Theorem for Any Cryptographic Protocol
event speaker icon
Iftach Ilan Haitner
event date icon
יום חמישי, 21.1.2010, 14:30
event location icon
חדר 337-8 טאוב.
Beyond Nash Equilibrium: Solution Concepts for the 21st Century
event speaker icon
Joe Halpern
event date icon
יום שלישי, 19.1.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Theory of Multiplexed Fluorescence Unmixing
event speaker icon
מרינה אלטרמן (הנדסת חשמל, טכניון)
event date icon
יום שלישי, 19.1.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Fluorescence microscopy is a powerful tool in biology and biomedical sciences. Microscopic specimens usually yield fluorescence intensity images that are dim and thus suffer from low signal-to-noise ratio (SNR). Moreover, in multispectral imaging of fluorescing specimen, intensities are just a means to obtain information about molecular distributions of the materials in the specimen. Multiplexed sensing is a way for increasing the signal-to-noise ratio (SNR) of intensity data arrays, without increasing acquisition resources such as time. ...
[לנוסח המלא]
Haifux, Haifa Linux Club: The FOSS Community as a Social Phenomenon
event speaker icon
ירון דישון (תלמיד החוג לסוציולוגיה, אונ' חיפה)
event date icon
יום שני, 18.1.2010, 18:30
event location icon
טאוב 6
What kind of community is it? Who are its members? What are its boundaries? מחקר זה מנסה להבין מהם התהליכים שהובילו להתכוננות קהילת הקוד הפתוח מתוך קבוצת האנשים הפעילים בפרוייקטים השונים. על אף שקהילת הקוד הפתוח נחקרה רבות מנקודת מבט טכנולוגית וארגונית, המחקר הסוציולוגי, היכול לתרום רבות להבנת התהליכים החברתיים המתרחשים במסגרת הקהילה, נמצא בחסר. על מנת לעקוב אחר תהליכים שהובילו לכינון הקהילה מצייר המחקר תמונה אודות תהליכי ההצטרפות של חברים חדשים בקהילה. בסדרה של ...
[לנוסח המלא]
Internet Routing: Foundations, Challenges and Future Directions
event speaker icon
Michael Schapira
event date icon
יום שני, 18.1.2010, 14:30
event location icon
חדר 337-8 טאוב.
Pixel Club Seminar: Segmentation of Image Ensembles via Latent Atlases
event speaker icon
תמי ריקלין-רביב (MIT ובי"ס לרפואה, הרוורד)
event date icon
יום שלישי, 12.1.2010, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
The images acquired via medical imaging modalities are frequently subject to low signal-to-noise ratio, bias field and partial volume effects. These artifacts, together with the naturally low contrast between image intensities of some neighboring structures, make the extraction of regions of interest (ROIs) in clinical images a challenging problem. Probabilistic atlases, typically generated from comprehensive sets of manually labeled examples, facilitate the analysis by providing statistical priors for tissue classification and structure segmentation. However, the ...
[לנוסח המלא]
Side Channels and their Mitigation in Cloud Computing Security
event speaker icon
Eran Tromer
event date icon
יום חמישי, 7.1.2010, 14:30
event location icon
חדר 337-8 טאוב.
Using Aspects to Support the Software Process
event speaker icon
אורן משלי
event date icon
יום רביעי, 6.1.2010, 15:30
event location icon
טאוב 601
Aspect-Oriented Programming (AOP) is a paradigm that allows the addition of new functionality to an existing system in a clean and modular fashion. In this research we utilize AOP to define support for the software development process within a development environment (Eclipse). AspectJ aspects that encapsulate software process support are defined and then integrated (woven) into the Eclipse code defining the development environment itself. Consequently, during the development, an Eclipse developer is presented with real-time ...
[לנוסח המלא]
Combinatorics Seminar: On Equivalence of Polynomial Conjectures in Additive Combinatorics
event speaker icon
שחר לווט (מכון ויצמן למדע)
event date icon
יום רביעי, 6.1.2010, 13:30
event location icon
אמאדו 719
We will discuss two important conjectures in additive combinatorics. The first one is the polynomial Freiman-Rusza conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for $U^3$, which relates to functions which locally look like quadratics. In both conjectures a weak form, with exponential decay of parameters is known, and a strong form with only a polynomial decay of parameters is conjectured. We will show that ...
[לנוסח המלא]
The Randomized k-Server Conjecture (Online Algorithms meet Linear Programming)
event speaker icon
Niv Buchbinder
event date icon
יום שלישי, 5.1.2010, 14:30
event location icon
חדר 337-8 טאוב.
Haifux, Haifa Linux Club: Offline Scheduler
event speaker icon
רז בן-יהודה (מסטרנט באונ' הפתוחה)
event date icon
יום שני, 4.1.2010, 18:30
event location icon
טאוב 6
OFFSCHED is a platform aimed to assign an assignment to an offloaded processor. An offloaded processor is a processor that is hot un-plugged from the operating system. In today's computer world, we find that most processors have several embedded cores and hyper-threading. Most programmers do not really use these powerful features and let the operating system do the work. At most, a programmer will bound an application to a certain processor or assign an interrupt ...
[לנוסח המלא]
Derandomized Search for Experimental Optimization
event speaker icon
Ofer M. Shir
event date icon
יום שני, 4.1.2010, 14:30
event location icon
חדר 337-8 טאוב.