Events

# The Taub Faculty of Computer Science Events and Talks

Efficient cloud operations via job-migration and pricing
Ishai Menache
Thursday, 30.12.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Practical Parallel Imaging Compresses Sensing MRI: Summary of Two Years of Experience Accelerating Body MRI of Pediatric Patients
Michael Lustig (Electrical Engineering and Computer Sciences, College of Engineering, UC Berkeley)
Thursday, 30.12.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Theory Seminar: Sequential Rationality in Cryptographic Protocols
Noam Livne (Weizmann Institute of Science)
Wednesday, 29.12.2010, 12:20
Room 337-8 Taub Bld.
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. ...
Pixel Club Seminar: Multi-Manifold Data Modeling: Foundations and Applications
Gilad Lerman (School of Mathematics, University of Minnesota)
Wednesday, 29.12.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Bioinformatics Forum (NOTE UNUSUAL HOUR): Single Molecule Sequencing Based Digital Gene Expression - Investigating the Transcriptome through a Clearer Lens
Doron Lipson (Foundation Medicine Inc.)
Tuesday, 28.12.2010, 15:00
Taub 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 ...
GraphLab: Asynchronous Graph Computation in the Clouds and Beyond
Danny Bickson
Tuesday, 28.12.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club: Voxel Fabbing: From Analog to Digital 3D Printing
Hod Lipson (Mechanical & Aerospace Engineering and Computing & Information Science at Cornell University)
Tuesday, 28.12.2010, 11:30
Room 337-8 Taub Bld.
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 ...
CGGC Seminar: AKVFs - A New Computational Tool for Approximate Shape
Mirela Ben-Chen (Stanford University)
Tuesday, 28.12.2010, 10:30
Taub 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 ...
AKVFs - A New Computational Tool for Approximate Shape Isometries
Mirela Ben-Chen
Tuesday, 28.12.2010, 10:30
Room Taub 7 Taub Bld.
Anisotropic diffusion maps of sub-manifolds with applications
Dan Kushnir
Sunday, 26.12.2010, 14:30
Room 337-8 Taub Bld.
Requirements Determination is Unstoppable: An Experience Report
Daniel M. Berry SPECIAL LECTURE note unusual hour
Sunday, 26.12.2010, 12:30
Room 337-8 Taub Bld.
Pixel Club Seminar: May the Optimal Candidate Win! Optimization under Social Choice Constraints
Ariel Procaccia
Thursday, 23.12.2010, 14:30
Room 337-8 Taub Bld.
CSpecial Talk: Topology in Distributed Computing
Prof. Eli Gafni (UCLA)
Wednesday, 22.12.2010, 14:30
Taub 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 ...
Bandwidth Allocation in Cellular Networks with Multiple Interferences
Gleb Polevoy
Wednesday, 22.12.2010, 14:00
Taub 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 ...
Theory Seminar: Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
Nir Ailon (CS, Technion)
Wednesday, 22.12.2010, 12:30
Room 337-8 Taub Bld.
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 ...
Haifux, Haifa Linux Club: Creative Commons Licenses, Open Source Software Licenses & the new Israeli Copyright Act of 2007
Dalit Ken-Dror (Haifa University)
Monday, 20.12.2010, 18:30
Taub 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
Steve Seitz (University of Washington)
Thursday, 16.12.2010, 11:30
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 ...
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
Ariel Kulik
Wednesday, 15.12.2010, 16:30
Taub 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 ...
Pixel Club Seminar: Efficient Linear Sketches for the Set Query Problem
Eric Price (MIT)
Wednesday, 15.12.2010, 13:30
EE Meyer Building 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 ...
Theory Seminar: Local List-Decoding with a Constant Number of Queries
Klim Efremenko (Tel-Aviv University)
Wednesday, 15.12.2010, 12:20
Room 337-8 Taub Bld.
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 ...
CGGC Seminar: Surface Comparison using Conformal Geometry
Yaron Lipman (Princeton University)
Wednesday, 15.12.2010, 11:30
Taub 5 (Floor 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 ...
Retro: An "Alway There" and "Not in The Way" Snapshot System
Liuba Shrira
Tuesday, 14.12.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Topics in Distributed Robotics
Alan Winfield (Hewlett-Packard Professor of Electronic Engineering and Director of the Science Communication Unit at the University of the West)
Tuesday, 14.12.2010, 12:30
Taub 401
TBD
Pixel Club Seminar: Toward Optimal Real-Time Transcoding of Images and Video Data Using Requantization
Ora Gendler (EE, Technion)
Tuesday, 14.12.2010, 11:30
EE Meyer Building 1061
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 ...
Theory Seminar: On the Semantics of Local Characterizations for Linear-Invariant Properties
Jakob Nordstrom (KTH Royal Institute of Technology)
Wednesday, 8.12.2010, 12:30
Room 337-8 Taub Bld.
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, ...
Pixel Club Seminar: Combined Local-Global Background Modeling for Anomaly Detection in Hyperspectral Images
Tuesday, 7.12.2010, 11:30
EE Meyer Building 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 ...
Haifux, Haifa Linux Club: Creative Commons Licenses, Open Source Software Licenses & the new Israeli Copyright Act of 2007
Dalit Ken-Dror (Haifa University)
Monday, 6.12.2010, 18:30
Taub 6
TBA
Applications of Shellable Complexes to Distributed Computing
Maurice Herlihy
Tuesday, 30.11.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Single Image Head Orientation and Gaze Detection
Jeremy Kaminski (CS, Holon Institute of Technology)
Tuesday, 30.11.2010, 11:30
Room 337-8 Taub Bld.
We introduce a system to compute both head orientation and gaze detection from a single image. The system uses a camera with ﬁxed parameters and requires no user calibration. Our approach to head orientation is based on a geometrical model of the human face, and ...
Connecting the Dots Between News Articles
Dafna Shahaf SPECIAL GUEST LECTURE
Sunday, 28.11.2010, 11:00
Room 337-8 Taub NOTE UNUSUAL DAY AND TIME Bld.
New Techniques for the Cryptanalysis of Hash Functions
Rafi Chen
Wednesday, 24.11.2010, 14:00
Taub 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 ...
Theory Seminar: The Topology of Shared-memory Adversaries
Maurice Herlihy, Brown University
Wednesday, 24.11.2010, 12:20
Room 337-8 Taub Bld.
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, ...
Approximated Learning and Inference in Large Scale Graphical Models
Tamir Hazan
Tuesday, 23.11.2010, 14:30
Room 337-8 Taub Bld.
Haifux, Haifa Linux Club: The Cairo Graphics Compositing Library
Boaz Goldstein
Monday, 22.11.2010, 18:30
Taub 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.
Dmitry Zinenko
Wednesday, 17.11.2010, 14:00
Taub 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 ...
Bioinformatics Forum: Identification of Rare Alleles and their Carriers using Compressed Se(que)nsing
Noam Shental (CS, The Open University of Israel)
Wednesday, 17.11.2010, 13:30
Taub 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 ...
Theory Seminar: Hats Auctions and Derandomization
Oren Ben-Zwi (Haifa University)
Wednesday, 17.11.2010, 12:30
Room 337-8 Taub Bld.
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. ...
Pixel Club Seminar: Representation, Processing and Animation of Images via Geometric Models
Yosef Yomdin (Math and CS, Weizmann Institute of Science)
Tuesday, 16.11.2010, 11:30
Room 337-8 Taub Bld.
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 ...
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)
Zohar Karnin (CS, Technion)
Wednesday, 10.11.2010, 12:30
Room 337-8 Taub Bld.
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 ...
Size-space tradeoffs in propositional proof complexity
Eli Ben-Sasson
Tuesday, 9.11.2010, 14:30
Room 337-8 Taub Bld.
Haifux, Haifa Linux Club: SSDL & Linux – a Love story or a Battle field? How to Change to Linux and Survive (Give or Take)
Shahar Dag (SSDL, CS, Technion)
Monday, 8.11.2010, 18:30
Taub 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 ...
Gravity currents as a test case: do simple mathematical models produce good physical insights, or do good insights generate powerful models?
Marius Ungarish
Tuesday, 2.11.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Navigation Performance Enhancement using Online Mosaicking
Tuesday, 2.11.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Dependent UFP On a Shared Channel With Application to a Network Centric Operation
Ilia Nudelman
Wednesday, 27.10.2010, 14:00
Taub 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, ...
Pixel Club Seminar: Transcription and Classification of Audio data by Sparse Representations and Geometric Methods
Michal Genussov (EE, Technion)
Wednesday, 27.10.2010, 13:30
EE Meyer Building 1061
Transcription and Classification of Audio Data by sparse Representations and Geometric Methods
Haifux, Haifa Linux Club: Secure File Systems
Orr Dunkelman (Weizmann Institute of Science)
Monday, 25.10.2010, 18:30
Taub 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 ...
Completeness and Universality Properties of Graph Invariants and Graph Polynomials
Ilia Averbouch
Wednesday, 20.10.2010, 14:00
Taub 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 ...
Pixel Club Seminar: Schizophrenic(*) Perspective on Software Testing
Yossi Gil (CS, Technion)
Wednesday, 20.10.2010, 12:30
Taub 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 ...
Pixel Club Seminar: Reading into the MAP: how mean is it ?
Remi Gribonval (INRIA)
Tuesday, 19.10.2010, 14:30
Room 337-8 Taub Bld.
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 ...
Should penalized least squares regression be interpreted as Maximum A Posteriori estimation? Subtitle: Reading into the map: how mean is it ?
Remi Gribonval
Tuesday, 19.10.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Integrating Computer Graphics and Computer Vision in Virtual Humans Projects
Soraia Raupp Musse (PUCRS - Computing Science Department)
Tuesday, 19.10.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Pixel Club Seminar: Sparsity-Based Signal Models and the Sparse K-SVD Algorithm
Ron Rubisnstein (CS, Technion)
Tuesday, 5.10.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Haifux, Haifa Linux Club: The Hitchhikers' Guide to the SHA-3 Competition
Orr Dunkelman (Weizmann Institute of Science)
Monday, 4.10.2010, 18:30
Taub 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 ...
Pixel Club Seminar: Blind Source Separation of Instantaneous
Michael Shamis (EE, Technion)
Tuesday, 21.9.2010, 14:30
EE Meyer Building 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 ...
Pixel Club Seminar: Surface and Volume Mapping via Mass Transport
Ayelet Dominitz (EE, Technion)
Tuesday, 21.9.2010, 11:30
EE Meyer Building 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 ...
Bioinformatics Forum: Towards The Systems Biology of Breast Cancer: Exploiting Multilevel Molecular Data of High Dimension
Miriam Ragle Aure (Department of Genetics, Institute for Cancer Research, Oslo University and Hospital Radiumhospitalet, Oslo, Norway ) and Ole-Christian Lingjærde (Centre for Cancer Biomedicine, Un
Wednesday, 15.9.2010, 13:30
Taub 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 ...
Pixel Club Seminar: Image Sequence Processing Without Motion Estimation
Matan Protter (CS, Technion)
Tuesday, 14.9.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Pixel Club Seminar: A Parallel Algorithm for Sparse Demixing - Applied to Retinal Imaging and Remote Sensing
Martin Ehler (Departments of Mathematics and Earth and Ocean Science, University of British Columbia)
Thursday, 2.9.2010, 14:30
Room 337-8 Taub Bld.
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 ...
Pixel Club Seminar: Reconstruction of the Brain Using High-Throughput Microscopy: Imaging, Segmentation, and Visualization
John Keyser (Computer Science and Engineering at Texas A&M University)
Monday, 30.8.2010, 10:00
EE Meyer Building 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 ...
An effective method for parameter estimation with PDE constraints with multiple right hand sides
Sunday, 29.8.2010, 14:30
Room 337-8 Taub Bld.
Haifux, Haifa Linux Club: HTML5 - The Next Generations of the Web
Tzafrir Rehan
Monday, 16.8.2010, 18:30
Taub 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 ...
Pixel Club Seminar: Measurement and Analysis the Biological Retinal Response, and Adaptation to Optical Stimulus
Gil Rivnai (EE, Technion)
Tuesday, 10.8.2010, 11:30
EE Meyer Building 1061
The retina is the first nerve system tissue that processes the visual information at the biological visual system. At this research, lab experiment performed to measure the response of the retinal response, the examination was perform from spatial point of view, by simultaneous recording from ...
Pixel Club Seminar: Rich Photography on a Budget
Sam Hasinoff (CSAIL, MIT)
Wednesday, 4.8.2010, 11:30
EE Meyer Building 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 ...
Haifux, Haifa Linux Club: Zemereshet - An Emergency Project for the Rescue and Electronic Documentation of Early Hebrew Music
Yair Even Zohar (Technion)
Monday, 2.8.2010, 18:30
Taub 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 ...
Topics in over-parametrized based variational methods
Shachar Shem-Tov
Wednesday, 28.7.2010, 11:30
Taub 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 ...
Haifux, Haifa Linux Club: Valgrind - From Magic to Science
Shachar Raindel (EE, Technion)
Monday, 26.7.2010, 18:30
Taub 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 ...
Pixel Club Seminar: Compressed Sensing for Hyperspectral Imaging
Udi Pfeffer (CS, Technion)
Wednesday, 14.7.2010, 11:30
EE Meyer Building 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 ...
Finding and Localizing Bugs in Dynamic Web Applications
Shay Artzi
Sunday, 11.7.2010, 14:30
Room 337-8 Taub Bld.
Haifux, Haifa Linux Club: GarlicSim: An Experimental Tool for Computer Simulations
Ram Rachum
Monday, 5.7.2010, 18:30
Taub 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 ...
CGGC Seminar: A Multi-Resolution Approach to Heat Kernels on Discrete Surfaces
Amir Vaxman (Computer Science, Technion)
Sunday, 4.7.2010, 13:00
Room 337-8 Taub Bld.
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 ...
Probabilistic Methods in Distributed Computing
Keren Censor-Hillel
Wednesday, 30.6.2010, 14:30
Taub 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 ...
Complex Barycentric Coordinates with Applications to Planar Shape Deformation and Interpolation
Ofir Weber
Wednesday, 30.6.2010, 11:00
Taub 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 ...
LOCATION, LOCATION, LOCATION: CASTING A WIDE NET ON GEOGRAPHIC INFORMATION SYSTEMS (GIS)
Hanan Samet
Tuesday, 29.6.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Incorporating Temporal Context in Bag-of-Words Models
Tamar Back (EE, Technion)
Tuesday, 29.6.2010, 11:30
EE Meyer Building 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 ...
Cross Layer Networking and Management for Mobile Wireless Networks
Distinguished Professor Izhak Rubin
Thursday, 24.6.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: What is a Cluster? Perspectives from Game Theory
Marcello Pelillo (University of Venice, Italy )
Thursday, 24.6.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Pixel Club Seminar: Non-parametric Atlas-Based Segmentation of Highly Variable Anatomy
Polina Golland (MIT/CSAIL)
Wednesday, 23.6.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Large networks, Communities and Kronecker Products
Jure Leskovec
Tuesday, 22.6.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Color Video Coding using Spatio-Temporal Correlation of Primary Colors
Rudi Primorac (EE, Technion)
Tuesday, 22.6.2010, 11:30
EE Meyer Building 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 ...
Haifux, Haifa Linux Club: Technological Challanges in Ben Yehuda Project
Asaf Bartov (Ben-Yehuda Project, Founder of Hebrew Literatuare Computing Society)
Monday, 21.6.2010, 18:30
Taub 6
פרוייקט בן-יהודה הוא מיזם התנדבותי אשר בונה ומתחזק מאגר חופשי של יצירה עברית שאינה מוגנת בזכויות יוצרים. המהדורות האלקטרוניות של היצירות מוגשות לציבור בחינם, ללא פרסומות, והן נחלת הכלל (public domain), וזמינות לכל שימוש, לרבות שימוש מסחרי. על אף המראה הבסיסי והמיושן של האתר הנוכחי, ...
Analysis and Detection of Interactions Among Aspects
Emilia Katz
Sunday, 20.6.2010, 12:30
Taub 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 ...
Pixel Club Seminar: Whole-Body Robot Sensing Is Prerequisite for Human-Robot Interaction and Teams
Vladimir Lumelsky (NASA, University of Maryland)
Sunday, 20.6.2010, 11:30
Room 337-8 Taub Bld.
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 ...
CGGC Seminar: Visualizing R^N – Representing Surfaces by their Normal Vectors
Alfred Inselberg (Mathematics, Tel Aviv University)
Sunday, 20.6.2010, 11:00
Taub 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 ...
A Brief History of the Internet
Distinguished professor Leonard Kleinrock
Wednesday, 16.6.2010, 14:30
EE Meyer Building 861
Online reconstruction of 3D objects from arbitrary cross-section data
Amit Bermano
Wednesday, 16.6.2010, 11:00
Taub 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 ...
My Life and My Work
Distinguished professor Leonard Kleinrock
Tuesday, 15.6.2010, 14:30
Room 337-8 Taub Bld.
CRYPTODAY2010
Workshop in Cryptology
Wednesday, 9.6.2010, 13:30
Taub 1
The 2010 Workshop in Cryptology will be held on Wednesday, June 9 2010, between 9:00-16:10, in Auditorium 1, CS Taub Building, Technion. You are all invited. More details and program
Bioinformatics Forum: Useful Tools in Finding Genetic Determinants of Complex Traits: Quantitative Genetic Analysis Software and Bioinformatics Resources for Marker Prioritization.
Dr. Sergey Ermakov (Sackler Faculty of Medicine, Tel Aviv University)
Wednesday, 9.6.2010, 13:30
Taub 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 ...
Pixel Club Seminar: "Good" Computation for the Motion of Colliding Objects
Eitan Grinspun (Computer Science, Columbia University)
Wednesday, 9.6.2010, 11:30
EE Meyer Building 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 ...
Bioinformatics Forum: Accurate Protein Function Prediction with the GOstruct Method
Asa Ben-Hur (Department of Computer Science, Colorado State University)
Wednesday, 9.6.2010, 11:00
Taub 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 ...
Regret Minimization and Job Scheduling
Yishay Mansour - Annual S. Even Distinguished Colloquium
Tuesday, 8.6.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Nash, Burago & Zalgaller and Image Processing
Emil Saucan (Mathematics, Technion)
Tuesday, 8.6.2010, 11:30
EE Meyer Building 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. ...
Haifux, Haifa Linux Club: Gupta et al.'s paper (and work) on Difference Engine.
Orna Agmon Ben-Yehuda (CS, Technion)
Monday, 7.6.2010, 18:30
Taub 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 ...
CGGC Seminar: A Polynomial Root Solver that preserves The Multiplicities of the Roots
Joab Winkler (Sheffield University, Sheffield, England
Thursday, 3.6.2010, 13:00
Taub 337
TBA
Bioinformatics Forum: Deriving Enzymatic and Taxonomic Signatures of Metagenomes from Short Read Data
Prof. David Horn (School of Physics & Astronomy, Tel Aviv University)
Wednesday, 2.6.2010, 13:30
Taub 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 ...
From Philosophical to Industrial Logics
Moshe Y. Vardi
Tuesday, 1.6.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Inverse Source Problems in Domains with Holes
Richard Tsai (Mathematics, University of Texas at Austin)
Tuesday, 1.6.2010, 14:30
EE Meyer Building 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
Radu Horaud (INRIA Rhone-Alpes, Grenoble, France)
Tuesday, 1.6.2010, 11:30
EE Meyer Building 1061
Pixel Club Seminar: 3D Shape Representation Using Diffusion Embeddings
Radu Horaud (INRIA Rhone-Alpes, Grenoble, France)
Monday, 31.5.2010, 11:30
EE Meyer Building 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 ...
Mathematics Club Seminar: Metric Geometry in Action
Ron Kimmel (CS, Technion)
Wednesday, 26.5.2010, 16:30
More detail in seminar poster פרטים נוספים
Privacy Preserving Data Mining
Arik Friedman
Wednesday, 26.5.2010, 14:00
Taub 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 ...
Computational Metric Geometry: A New Tool in Image Sciences
Michael Bronstein
Tuesday, 25.5.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: On the Role of Color Information in Image Processing and Visual Communication
Evgeny Gershikov (Technion)
Tuesday, 25.5.2010, 11:30
EE Meyer Building 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 ...
Haifux, Haifa Linux Club: KDE 4 - The Good, The Bad, and The Broken
Dotan Cohen (Technion)
Monday, 24.5.2010, 18:30
Taub 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 ...
Oblivious and Cost Aware Distributed Load Sharing in the Cloud
Danny Raz
Tuesday, 11.5.2010, 14:30
Room 337-8 Taub Bld.
Haifux, Haifa Linux Club: Compromising Electromagnetic Emanations of Wired and Wireless Keyboards
Roy Migdal (CS, Technion)
Monday, 10.5.2010, 18:30
Taub 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 ...
Pixel Club Seminar: Non-Rigid Shape Correspondence by Matching Semi-Local Spectral Features and Global Geodesic Structures
Anastasia Dubrovina (CS, Technion)
Monday, 10.5.2010, 11:30
EE Meyer Building 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 ...
Bitonic Sorters Of Minimal Depth
Tamir Levi
Wednesday, 5.5.2010, 14:30
Taub 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 ...
The Identification of Join Candidates in the Cairo Genizah: An interdisciplinary challenge in computer assisted text processing
Lior Wolf
Tuesday, 4.5.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar:
נחילים – מעולם הטבע לעולם ההנדסה – מה ניתן ללמוד מהטבע
Arik Yavnai
Tuesday, 4.5.2010, 11:30
EE Meyer Building 1061
חקירה והתבוננות בעולם הטבע חוללה תובנות רבות בקרב החוקרים. נחילים בטבע, כמו גם בעלי חיים החיים בקבוצות שיתופיות, מציגים יכולות מרשימות בהשגת יעדים קבוצתיים, גם אם יכולות הפרטים בקהילה מוגבלות למדי. התמודדות עם בעיות מורכבות מדרבנת את החיפוש אחר פתרונות הכרוכים בהפעלה של מערכים הנדסיים ...
Pixel Club Seminar: Theory and Algorithms for Anisotropic Triangulations with Applications to Image Representations
Albert Cohen (Laboratoire J.-L. Lions, University Paris VI)
Wednesday, 28.4.2010, 11:30
Room 337-8 Taub Bld.
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 ...
Haifux, Haifa Linux Club: Making the Internet Accessible - workshop
Orr Dunkelman (Weizmann Institute)
Monday, 26.4.2010, 18:30
Taub 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 ...
Bioinformatics Forum: An Algorithmic Framework for Predicting Side-Effects of Drugs
Nir Atias (The Blavatnik School of Computer Science, Tel Aviv University)
Wednesday, 21.4.2010, 14:30
Room 337-8 Taub Bld.
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 ...
Movement Problems
Daniel Marx
Tuesday, 13.4.2010, 14:30
Room 337-8 Taub Bld.
Haifux, Haifa Linux Club: Genetic Algorithms
Omer Boehm
Monday, 12.4.2010, 18:30
Taub 6
TBA
Theory Seminar: A Thermodynamic Approach to the Analysis of Multi-Robot Cooperative Localization under Independent Errors
Yotam Elor (CS, Technion)
Wednesday, 7.4.2010, 12:30
Taub 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 ...
Online Set Packing and Competitive Scheduling of Multi-Part Tasks
Dror Rawitz
Tuesday, 6.4.2010, 14:30
Room 337-8 Taub Bld.
The security tower of Babel
Yuri Gurevich
Thursday, 25.3.2010, 14:30
Room 337-8 Taub Bld.
Model Checking Using Tree-width Methods: Old and New
Isolde Adler SPECIAL LECTURE note unusual hour
Thursday, 18.3.2010, 11:30
Room 601 Taub Bld.
Code Structures in Java
Itay Maman
Wednesday, 17.3.2010, 14:30
Taub 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 ...
Theory Seminar: On the Degree of Symmetric Functions on the Boolean Cube
Gil Cohen (CS, Technion)
Wednesday, 17.3.2010, 12:30
Taub 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 ...
Fixed-parameter algorithms for graph separation problems
Igor Razgon
Tuesday, 16.3.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Computational Aesthetics - Science or Art?
Oliver Deussen (University of Konstanz, Germany)
Tuesday, 16.3.2010, 11:30
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 ...
Haifux, Haifa Linux Club: Scientific Programming with Modern Fortran
Shimon Panfil (Ph.D.)
Monday, 15.3.2010, 18:30
Taub 8 (note different place)
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 ...
Bioinformatics Forum: An Universal Adaptive Translation Efficiency Profile of Proteins
Tzachi Pilpel (Weizmann Institute of Science)
Monday, 15.3.2010, 14:30
Room 337-8 Taub Bld.
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 ...
Theory Seminar: Non-Preemptive Buffer Management for Latency Sensitive Packets
Moran Feldman (CS, Technion)
Wednesday, 10.3.2010, 12:30
Taub 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 ...
Property Testing and its application in databases
Eldar Fischer
Tuesday, 9.3.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Shape-constrained Graph Min-cut approach for Medical Image Segmentation
Moti Freiman (CS, Hebrew University of Jerusalm)
Tuesday, 9.3.2010, 11:30
EE Meyer Building 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 ...
CGGC Seminar: 3D Surface Reconstruction Using A Generalized Distance Function
Roi Poranne (Computer Science, Technion)
Sunday, 7.3.2010, 13:00
Room 337-8 Taub Bld.
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 ...
On the Performance of Dijkstra's 3rd Self-stabilizing Algorithm for Mutual Exclusion and Related Algorithms
Viacheslav Chernoy
Wednesday, 3.3.2010, 14:00
Taub 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 ...
Haifux, Haifa Linux Club: Drupal
Michael Shmilov Yoni Limor (yam-design) and Israel David
Monday, 1.3.2010, 18:30
Taub 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 ...
IE Student M.Sc. Seminar: Optimizing the Size of Software Inspection Teams
Alexander Raginsky
Tuesday, 23.2.2010, 11:00
Taub 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 ...
Learning from Multiple Teachers
Ofer Dekel
Thursday, 18.2.2010, 14:30
Room 337-8 Taub Bld.
Abstractions for devising compact controllers for MDPs
Kolman Vornovitsky
Wednesday, 17.2.2010, 15:30
Taub 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 ...
Cryptography by the People, for the People: How Voting and Cryptography Go Hand-in-Hand
Tal Moran
Tuesday, 16.2.2010, 14:30
Room 337-8 Taub Bld.
Haifux, Haifa Linux Club: VoIP in Linux
Rami Rosen
Monday, 15.2.2010, 18:30
Taub 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 ...
Optimal Network Locality in Distributed Services
Gwendal Simon SPECIAL TALK
Monday, 15.2.2010, 14:30
Room 337-8 Taub Bld.
Theory Seminar: The Strength of Parameterized Tree-like Resolution
Massimo Lauria (Università di Roma)
Wednesday, 10.2.2010, 13:30
Taub 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 ...
An online distributed system for genetic linkage analysis
Mark Silberstein
Wednesday, 10.2.2010, 11:00
Taub 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 ...
Scalable Garbage Collection on Highly Parallel Platforms
Katherine Barabash
Wednesday, 3.2.2010, 14:00
Taub 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 ...
Computational methods for metagenomic analysis
Itai Shaked
Wednesday, 3.2.2010, 12:00
Room 4 (1st floor), Taub
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 ...
Haifux, Haifa Linux Club: Hspell - A Retrospective
Monday, 1.2.2010, 18:30
Taub 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 ...
Computational Modeling and Algorithms in Molecular Evolution and Gene Translation
Tamir Tuller
Thursday, 28.1.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Shift-Map Image Editing
Yael Pritch (School of Computer Science and Engineering ,The Hebrew University of Jerusalem)
Tuesday, 26.1.2010, 11:30
EE Meyer Building 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 ...
Accelerating the TSUBAME Supercomputer with Graphics Processing Units and its Implications to Systems Research
Naoya Maruyama
Sunday, 24.1.2010, 14:30
Room 337-8 Taub Bld.
A Parallel Repetition Theorem for Any Cryptographic Protocol
Iftach Ilan Haitner
Thursday, 21.1.2010, 14:30
Room 337-8 Taub Bld.
Beyond Nash Equilibrium: Solution Concepts for the 21st Century
Joe Halpern
Tuesday, 19.1.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Theory of Multiplexed Fluorescence Unmixing
Marina Alterman (EE, Technion)
Tuesday, 19.1.2010, 11:30
EE Meyer Building 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 ...
Haifux, Haifa Linux Club: The FOSS Community as a Social Phenomenon
Yaron Dishon (Sociology Dept. student, Haifa University)
Monday, 18.1.2010, 18:30
Taub 6
What kind of community is it? Who are its members? What are its boundaries? מחקר זה מנסה להבין מהם התהליכים שהובילו להתכוננות קהילת הקוד הפתוח מתוך קבוצת האנשים הפעילים בפרוייקטים השונים. על אף שקהילת הקוד הפתוח נחקרה רבות מנקודת מבט טכנולוגית וארגונית, המחקר הסוציולוגי, היכול ...
Internet Routing: Foundations, Challenges and Future Directions
Michael Schapira
Monday, 18.1.2010, 14:30
Room 337-8 Taub Bld.
Pixel Club Seminar: Segmentation of Image Ensembles via Latent Atlases
Tammy Riklin-Raviv (Medical Vision Group CSAIL, MIT & Surgical Planning Laboratory, Harvard Medical School)
Tuesday, 12.1.2010, 11:30
EE Meyer Building 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 ...
Side Channels and their Mitigation in Cloud Computing Security
Eran Tromer
Thursday, 7.1.2010, 14:30
Room 337-8 Taub Bld.
Using Aspects to Support the Software Process
Oren Mishali
Wednesday, 6.1.2010, 15:30
Taub 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 ...
Combinatorics Seminar: On Equivalence of Polynomial Conjectures in Additive Combinatorics
Shachar Lovett (Weizmann Institute)
Wednesday, 6.1.2010, 13:30
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. ...
The Randomized k-Server Conjecture (Online Algorithms meet Linear Programming)
Niv Buchbinder
Tuesday, 5.1.2010, 14:30
Room 337-8 Taub Bld.
Haifux, Haifa Linux Club: Offline Scheduler
Raz Ben Yehuda (Ms.c student in the Open University)
Monday, 4.1.2010, 18:30
Taub 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 ...
Derandomized Search for Experimental Optimization
Ofer M. Shir
Monday, 4.1.2010, 14:30
Room 337-8 Taub Bld.