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

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

Efficient flow-based image segmentation techniques for de-blurring medical imaging and identifying hidden structures
event speaker icon
Dorit S. Hochbaum
event date icon
יום ראשון, 30.12.2007, 15:00
event location icon
חדר 337-8 טאוב.
Approximate Hypergraph Partitioning and Applications
event speaker icon
אסף שפירא
event date icon
יום ראשון, 30.12.2007, 10:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
I will describe an O(n) time algorithmic version of Szemerdi's regularity lemma. Unlike all the previous approaches for this problem, which proved the lemma "algorithmically", and only guaranteed to find partitions of tower-size, our algorithm will find a small regular partition in the graph in the case that one exists. The algorithm can be extended to an O(n) time algorithmic version of the hypergraph regularity lemma for k-uniform hypergraphs, improving over the previous O(n^{2k-1}) algorithms. ...
[לנוסח המלא]
The Four Levels of Requirements Engineering for and in Dynamic Adaptive Systems
event speaker icon
Daniel Berry
event date icon
יום חמישי, 27.12.2007, 11:30
event location icon
חדר 337-8 טאוב.
An implicit approach to closed surface and contour segmentation based on geodesic meshing and transport equation
event speaker icon
פתחאללה בן-מנסור
event date icon
יום רביעי, 26.12.2007, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
We present a new method for segmenting closed curves or surfaces from a single point. Our work builds on a variant of the Fast Marching algorithm and an implicit approach which solves a transport equation. The goal is to define the curve as a series of minimal paths linking successive keypoints. First, an initial point on the desired boundary is chosen by the user. Next, new keypoints are detected automatically using a front propagation approach. ...
[לנוסח המלא]
Technologies for fish growers: from ornamental fish in greenhouses to edible fish in the open sea
event speaker icon
בעז ציון
event date icon
יום שלישי, 25.12.2007, 11:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Development of technologies for agriculture is very complex. The products (fruits, vegetables, flowers, livestock etc) are non-uniform and susceptible, the sceneries (illumination, topography, geometry etc) are complex and vary with time, and the low cost of the products is a limiting factor to the cost effectiveness of the technology. When the technologies deal with live fish, the constraints, requirements and limitations are even more acute due to two main reasons: underwater conditions may be quite ...
[לנוסח המלא]
Exact rotation minimizing frame via Moebius transformations
event speaker icon
מיכאל ברטון
event date icon
יום ראשון, 23.12.2007, 13:00
event location icon
חדר 337, בניין טאוב למדעי המחשב
Rotation minimizing frames are useful for various applications in geometric modeling and computer graphics. For instance, the sweeping of one (cross-section) curve along the another one (spine curve) is well-known technique of surface construction in 3D shape modeling. In many applications, namely in the construction of canal surfaces, the minimal twist of the cross- section curve along the spine curve is required. For a general spine curve, the computation of the exact rotation minimizing frame ...
[לנוסח המלא]
Delegating Computation: Interactive Proofs for Mortals
event speaker icon
גיא רוטבלום
event date icon
יום ראשון, 23.12.2007, 10:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Suppose you are a user with a weak computational device connected to a network, e.g. a cell phone, and you need to perform a computation beyond your abilities. A natural solution is for you to *delegate* the expensive computation to a stronger computational device on the same network, say a server. The problem is that you may not trust the answer of this server: it may be unreliable or malicious. Can the server give you ...
[לנוסח המלא]
Probabilistic Correspondence with Applications to Semantic Image Analysis
event speaker icon
Gal Elidan
event date icon
יום חמישי, 20.12.2007, 14:30
event location icon
חדר 337-8 טאוב.
80 Million Tiny Images
event speaker icon
רוב פרגוס
event date icon
יום רביעי, 19.12.2007, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Non-parametric approaches to object recognition have received limited attention in the Computer Vision community due to the high dimensionality of visual data. With the advent of the Internet, billions of images are now freely available online and constitute a dense sampling of the visual world. We explore this world with the aid of a large dataset of 108 images collected from the Internet, using a variety of non-parametric methods. Motivated by psychophysical results showing the ...
[לנוסח המלא]
Learnability and the Testing of Experts
event speaker icon
נביל אל-נז'אר
event date icon
יום רביעי, 19.12.2007, 10:30
event location icon
חדר 527, בניין בלומפלד, הטכניון
We study the problem of testing an expert who is required to submit forecasts that have a learnable parametric representations. The class of stochastic processes with such representations, introduced by Jackson, Kalai and Smorodinsky (1999), include exchangeable and Markov process as special cases, and encompasses all processes used in Bayesian statistics. We define a simple test that screens experts whose forecasts belong to this class. The test stipulates an initial phase during which the expert ...
[לנוסח המלא]
Algorithms for Gene Finding, Network Alignment, and Ancestral Population Inference
event speaker icon
Serafim Batzoglou
event date icon
יום שלישי, 18.12.2007, 14:30
event location icon
חדר 337-8 טאוב.
Image Statistics in Computational Photography
event speaker icon
ענת לוין
event date icon
יום שלישי, 18.12.2007, 11:30
event location icon
EE Meyer Building 1061
The digital photography revolution has greatly facilitated the way in which we take and share pictures. However, it has mostly relied on a rigid imaging model inherited from traditional photography. Computational photography goes one step further and exploits digital technology to enable arbitrary computation between the light array and the final image or video. Such computation can overcome limitations of the imaging hardware and enable new applications. It can also enable new imaging setups and ...
[לנוסח המלא]
Redshift, Virtualization, and Data Centers
event speaker icon
Richard Zippel
event date icon
יום שני, 17.12.2007, 11:30
event location icon
חדר 401 טאוב.
Can simple markets achieve good results?
event speaker icon
Liad Blumrosen
event date icon
יום ראשון, 16.12.2007, 14:30
event location icon
חדר 337-8 טאוב.
The mathematical aspects of origami
event speaker icon
יוחאי צור
event date icon
יום ראשון, 16.12.2007, 13:00
event location icon
חדר 337, בניין טאוב למדעי המחשב
Origami (or paper folding) is an ancient art, focused on the creation of figures by applying a series of folds on a paper, without cutting the paper or gluing it. Though Origami is known for more than a thousand years, the past 60 years have seen a renaissance in this art and an acceleration of its evolution, which might be realized both in the amount of published designs and in the increasing complexity of the ...
[לנוסח המלא]
Local Embedding of Metric Spaces
event speaker icon
עופר ניימן
event date icon
יום ראשון, 16.12.2007, 10:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
In many application areas, complex data sets are often represented by some metric space and metric embedding is used to provide a more structured representation of the data. In many of these applications much greater emphasis is put on the preserving the local structure of the original space than on maintaining its complete structure. In this paper we initiate the study of local embeddings of metric spaces and provide embeddings with distortion depending solely on ...
[לנוסח המלא]
Evolution of gene architecture: challenging the neutral paradigm
event speaker icon
Liran Carmel
event date icon
יום חמישי, 13.12.2007, 14:30
event location icon
חדר 337-8 טאוב.
Image Statistics in Computational Photography
event speaker icon
Anat Levin
event date icon
יום שלישי, 11.12.2007, 14:30
event location icon
חדר 337-8 טאוב.
Protein Structuring from Random Cryo-EM Images
event speaker icon
יואל שקולניסקי
event date icon
יום שלישי, 11.12.2007, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We describe a spectral graph algorithm for reconstructing the three-dimensional structure of molecules from their Cryo-EM images taken at random unknown orientations. The key idea of the algorithm is designing a sparse operator defined on the projection data, whose eigenvectors reveal the orientation of each projection. Such an operator is constructed by utilizing the geometry induced on Fourier space by the projection-slice theorem. The presented algorithm is direct (as opposed to iterative refinement schemes), does ...
[לנוסח המלא]
My modeling efforts
event speaker icon
גיורא אשכול
event date icon
יום ראשון, 9.12.2007, 13:00
event location icon
חדר 337, בניין טאוב למדעי המחשב
I was introduced into 3D modeling as an artist back in 1993 using Amiga 4000a and a software name "Real-3d". The modeling tools I had were of B-spline type. The following year I was modeling with Alias Power Animator and later to MAYA which offers tools for NURBS, Polygons, and Sub-D. Using those tools I created many complex modeling works of the human body and organic objects as well as still objects. Among my works ...
[לנוסח המלא]
Estimating the Required Number of Code Inspectors
event speaker icon
Eliezer Kantorowitz
event date icon
יום חמישי, 6.12.2007, 14:30
event location icon
חדר 337-8 טאוב.
How to Steal Cars - A Practical Attack on KeeLoq
event speaker icon
Orr Dunkelman
event date icon
יום שלישי, 4.12.2007, 14:30
event location icon
חדר 337-8 טאוב.
On the hardness of entangled multi-prover games
event speaker icon
יוליה קמפה
event date icon
יום ראשון, 2.12.2007, 10:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Multi-prover games have played a tremendous role in theoretical computer science over the last two decades. A lot of research effort went into determining how hard it is to approximate the value of such games, culminating in the celebrated PCP Theorem. When considering multi-prover games in the quantum world, the laws of quantum mechanics allow for a fascinating new effect: namely, the provers can share an arbitrary entangled state, on which they may perform any ...
[לנוסח המלא]
Towards Cellular Models of Protein and Metabolic Networks
event speaker icon
Tomer Shlomi
event date icon
יום חמישי, 29.11.2007, 14:30
event location icon
חדר 337-8 טאוב.
Independence preserving graphs obtained after marginalizing and conditioning in directed acyclic graphs
event speaker icon
Nanny Wermuth
event date icon
יום שלישי, 27.11.2007, 14:30
event location icon
חדר 5 טאוב.
Seam Carving for Content-Aware Image Resizing
event speaker icon
שי אבידן
event date icon
יום ראשון, 25.11.2007, 14:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
Effective resizing of images should not only use geometric constraints, but consider the image content as well. We present a simple image operator called seam carving that supports content-aware image resizing for both reduction and expansion. A seam is an optimal 8-connected path of pixels on a single image from top to bottom, or left to right, where optimality is defined by an image energy function. By repeatedly carving out or inserting seams in one ...
[לנוסח המלא]
Unconditional pseudorandom generators for low degree
event speaker icon
שחר לווט
event date icon
יום ראשון, 25.11.2007, 10:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
We give an explicit construction of pseudorandom generators against low degree polynomials over finite fields. We show that the sum of 2^d small-biased generators with error epsilon^{2^{O(d)} is a pseudorandom generator against degree d polynomials with error epsilon. This gives a generator with seed length 2^O(d)*.log{(n/epsilon)}. Our construction follows the recent breakthrough result of Bogadnov and Viola \cite{BV}. Their work shows that the sum of $d$ small-biased generators is a pseudo-random generator against degree $d$ ...
[לנוסח המלא]
Data Discretization Unification
event speaker icon
Yuri Breitbart
event date icon
יום חמישי, 22.11.2007, 14:30
event location icon
חדר 337-8 טאוב.
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this talk, we prove that discretization methods based on informational theoretical complexity and the methods based on statistical measures of data dependency are asymptotically equivalent. Furthermore, we define a notion of generalized entropy and prove that discretization methods based on MDLP, Gini Index, AIC, BIC, Pearson's X_2, and Wilks' G_2 ...
[לנוסח המלא]
Visual Tracking in a General Context via Tracker Combination and Low-Level Cues
event speaker icon
עדו לייכטר
event date icon
יום רביעי, 21.11.2007, 14:00
event location icon
טאוב 601
Object tracking is one of the basic and difficult aspects of computer vision. It is generally a prerequisite for other computer vision tasks such as object recognition, as well as a goal by itself in applications such as video surveillance. We address the problem of visual tracking in a general context using two approaches. Our first approach is the combination of multiple trackers that use different features and thus have different failure modes. We propose ...
[לנוסח המלא]
Seam Carving for Content-Aware Image Resizing
event speaker icon
שי אבידן
event date icon
יום שלישי, 20.11.2007, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Effective resizing of images should not only use geometric constraints, but consider the image content as well. We present a simple image operator called seam carving that supports content-aware image resizing for both reduction and expansion. A seam is an optimal 8-connected path of pixels on a single image from top to bottom, or left to right, where optimality is defined by an image energy function. By repeatedly carving out or inserting seams in one ...
[לנוסח המלא]
Computational coarse graining: from particle-based simulations to a continuum description
event speaker icon
Chay Goldenberg
event date icon
יום שלישי, 13.11.2007, 14:30
event location icon
חדר 337-8 טאוב.
Low-end uniform hardness versus randomness tradeoffs for AM
event speaker icon
רונן שאלתיאל
event date icon
יום ראשון, 11.11.2007, 10:30
event location icon
חדר 337, בנין טאוב למדעי המחשב
In 1998, Impagliazzo and Wigderson proved a hardness vs. randomness tradeoff for BPP in the /uniform setting/, which was subsequently extended to give optimal tradeoffs for the full range of possible hardness assumptions by Trevisan and Vadhan (in a slightly weaker setting). In 2003, Gutfreund, Shaltiel and Ta-Shma proved a uniform hardness vs. randomness tradeoff for AM, but that result only worked on the "high-end" of possible hardness assumptions. In this work, we give uniform ...
[לנוסח המלא]
Finding Nemo: Translating reactive tasks to reactive controllers
event speaker icon
Hadas Kress-Gazit
event date icon
יום חמישי, 8.11.2007, 14:30
event location icon
חדר 337-8 טאוב.
Membrane computing (an introduction): Power and efficiency
event speaker icon
Gheorghe Paun
event date icon
יום שלישי, 6.11.2007, 14:30
event location icon
חדר 337-8 טאוב.
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
event speaker icon
ג'ונתן (יעקב) הוך
event date icon
יום ראשון, 4.11.2007, 10:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
We study the round complexity of various cryptographic protocols. Our main result is a tight lower bound on the round complexity of any fully-black-box construction of a statistically-hiding commitment scheme from one-way permutations, and even from trapdoor permutations. This lower bound matches the round complexity of the statistically-hiding commitment scheme due to Naor, Ostrovsky, Venkatesan and Yung (CRYPTO '92). As a corollary, we derive similar tight lower bounds for several other cryptographic protocols, such as ...
[לנוסח המלא]
Zyzzyva: Speculative Byzantine Fault Tolerance
event speaker icon
Lorenzo Alvisi
event date icon
יום חמישי, 1.11.2007, 11:30
event location icon
חדר 337-8 טאוב.
Does it make any sense to move your head when you look at a mirror?
event speaker icon
אוהד בן-שחר
event date icon
יום שלישי, 30.10.2007, 11:30
event location icon
חדר 601, בניין טאוב למדעי המחשב
The image of a curved, specular (mirror-like) surface is a distorted reflection of the environment. Although the recovery of such specular shape from its image appears futile without some knowledge of the environment, the goal of this work is to develop a theoretical and practical framework for solving this shape inference problem when the environment is completely unknown. We show that although this general problem is severely ill-posed, allowing relative object-environment motion induces a dense ...
[לנוסח המלא]
Why is the chromatic polynomial a polynomial?
event speaker icon
יוהן מקובסקי
event date icon
יום ראשון, 28.10.2007, 10:30
event location icon
חדר 337, בניין טאוב למדעי המחשב
The number of k-vertex colorings of a graph is a polynomial in k, the chromatic polynomial. Many other graph invariants (Tutte polynomial, matching polynomial, interlace polynomial, cover polynomial) are also polynomials (possibly in several variables). We show that this is no accident. The speaker introduced the notion of graph polynomials definable in Monadic Second Order Logic, and showed that the Tutte polynomial and its generalization, the matching polynomial, the cover polynomial and the various interlace ...
[לנוסח המלא]
Colorful geometric spanners
event speaker icon
Carmi Paz
event date icon
יום שלישי, 16.10.2007, 14:30
event location icon
חדר 337-8 טאוב.
Noise reduction in CT and real-time image compression using variational models
event speaker icon
Harald Koestler
event date icon
יום שלישי, 9.10.2007, 11:30
event location icon
חדר 337-8 טאוב.
Broadcasting in Geometric Radio Networks
event speaker icon
Andrzej Pelc
event date icon
יום חמישי, 20.9.2007, 14:30
event location icon
חדר טאוב 337-8 Bld.
SNZI: Scalable NonZero Indicators
event speaker icon
Yossi Lev
event date icon
יום רביעי, 19.9.2007, 10:30
event location icon
חדר 601 טאוב.
Distributed Image and Video Processing: Directed Graphs, Bayesian Estimation, and Hidden Markov Models
event speaker icon
פרופ' דן שונפלד
event date icon
יום שלישי, 21.8.2007, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Traditional image and video processing algorithms are centralized. They rely on an implementation on a large server for efficient processing. However, with the emergence of large camera networks, we must design distributed algorithms that can scale with the size of the network and number of targets. In this talk, we present a general methodology to the design of distributed image and video processing systems. The premise of our approach to distributed processing is the graphical ...
[לנוסח המלא]
Harmony in Motion: Audio-Visual Association
event speaker icon
זוהר ברזילי
event date icon
יום שלישי, 31.7.2007, 16:00
event location icon
חדר 861 , בניין מאייר, הפקולטה להנדסת חשמל
Cross-modal analysis offers information beyond that extracted from individual modalities. Consider a camcorder having a single microphone in a cocktail-party: it captures several moving visual objects which emit sounds. A task for audio-visual analysis is to identify the number of independent audio-associated visual objects (AVOs), pinpoint the AVOs' spatial locations in the video and isolate each corresponding audio component. Part of these problems were considered by prior studies, which were limited to simple cases, e.g., ...
[לנוסח המלא]
N-hub Shortest-Path: A New Routing Paradigm for the Internet
event speaker icon
גבי נקבלי
event date icon
יום רביעי, 25.7.2007, 15:00
event location icon
טאוב 601
We study the computational complexity and effectiveness of a concept we term "N-hub Shortest-Path Routing" in IP networks. N-hub Shortest-Path Routing allows the ingress node of a routing domain to determine up to N intermediate nodes ("hubs") through which a packet will pass before reaching its final destination. This facilitates better utilization of the network resources, while allowing the network routers to continue to employ the simple and well-known shortest-path routing paradigm. Our results show ...
[לנוסח המלא]
DOORS to the Semantic Web and Grid with a PORTAL for Biomedical Computing
event speaker icon
Carl Taswell
event date icon
יום שלישי, 17.7.2007, 14:30
event location icon
חדר 337-8 טאוב.
Functional Hierarchy: Representation and Modeling of Spatial Patterns of Activation in fMRI
event speaker icon
Polina Golland
event date icon
יום שני, 16.7.2007, 11:30
event location icon
טאוב 337
In this talk, I will present a novel approach to computational modeling of spatial activation patterns observed through fMRI. Functional connectivity analysis is widely used in fMRI studies for detection and analysis of large networks that co-activate with a user-selected `seed' region of interest. In contrast, our method is based on clustering; it simultaneously identifies interesting seed time courses and associates voxels with the respective networks. This generalization eliminates the sensitivity to the threshold used ...
[לנוסח המלא]
4 Open Problems
event speaker icon
Azaria Paz
event date icon
יום שלישי, 3.7.2007, 14:30
event location icon
חדר 337-8 טאוב.
Peer-to-Peer Web Search with Minerva
event speaker icon
Gerhard Weikum
event date icon
יום ראשון, 24.6.2007, 14:30
event location icon
חדר 337-8 טאוב.
Mobility versus the cost of geocasting in Mobile Ad-Hoc network
event speaker icon
Alessia Milani
event date icon
יום חמישי, 21.6.2007, 14:30
event location icon
חדר 337-8 טאוב.
On two optimization problems: Permutation Routing, and Finding Small Subgraphs of Given Minimum Degree
event speaker icon
Ignasi Sau -
event date icon
יום רביעי, 20.6.2007, 13:30
event location icon
חדר 337 טאוב.
Robust Reasoning with User Preference Expressions
event speaker icon
Carmel Domshlak
event date icon
יום ראשון, 17.6.2007, 14:30
event location icon
חדר 337-8 טאוב.
The Aspect-Oriented Language Compose*
event speaker icon
Prof. Mehmet Aksit
event date icon
יום ראשון, 10.6.2007, 13:30
event location icon
חדר 6 טאוב (NOTE unusual time and room) Bld.
Graph-Based State Spaces
event speaker icon
Prof. Arend Rensink SPECIAL GUEST TALK
event date icon
יום חמישי, 7.6.2007, 15:30
event location icon
חדר 601 טאוב.
Stopping Redundancy and Iterative Erasure Decoding
event speaker icon
Professor Paul H. Siegel
event date icon
יום חמישי, 7.6.2007, 14:30
event location icon
חדר 337-8 טאוב.
קריפטוגרפיה: מבט אישי. לזכרו של פרופ' שמעון אבן
event speaker icon
עדי שמיר - הרצאה לזכרו של שמעון אבן
event date icon
יום חמישי, 31.5.2007, 16:30
event location icon
טאוב 337
My personal involvement in Cryptography started exactly 30 years ago, with the invention of the RSA cryptosystem in 1977. In this talk I will describe some of the major trends in academic cryptographic research over this period, Prof. Shimon Even's early contributions to the field, and some of the most interesting recent results. The talk will be quite general, and accessible to non-experts.
[לנוסח המלא]
Testing Independence Properties of Distributions
event speaker icon
Ronitt Rubinfeld
event date icon
יום ראשון, 27.5.2007, 14:30
event location icon
חדר 337-8 טאוב.
Testing Independence Properties of Distributions
event speaker icon
Ronitt Rubinfeld
event date icon
יום ראשון, 27.5.2007, 10:30
event location icon
חדר 337-8 טאוב.
Programming languages course - a proposal
event speaker icon
Catriel Beeri
event date icon
יום חמישי, 17.5.2007, 14:30
event location icon
חדר 337-8 טאוב.
Energy Efficient Online Deadline Scheduling
event speaker icon
Prudence Wong
event date icon
יום ראשון, 13.5.2007, 14:30
event location icon
חדר 337-8 טאוב.
Random Selection and Byzantine Agreement in the Full-Information Model
event speaker icon
Vinod Vaikuntanathan
event date icon
יום שלישי, 8.5.2007, 14:30
event location icon
חדר 337-8 טאוב.
Smooth Sensitivity and Sampling in Private Data Analysis
event speaker icon
Kobbi Nissim
event date icon
יום שלישי, 1.5.2007, 14:30
event location icon
חדר 337-8 טאוב.
Scalable Breakpoints, Watchpoints, and Checkpoints for Supercomputers
event speaker icon
Larry Rudolph
event date icon
יום ראשון, 15.4.2007, 12:30
event location icon
חדר 337-8 טאוב.
Artificial Time Integration
event speaker icon
Uri Ascher
event date icon
יום חמישי, 12.4.2007, 14:30
event location icon
חדר 337-8 טאוב.
On the Complexity of Sequential Rectangle Placement
event speaker icon
Amos Israeli
event date icon
יום שלישי, 10.4.2007, 14:30
event location icon
חדר 337-8 טאוב.
Playing "Hide-and-Seek" in Finite Fields: Hidden Number Problem and Its Applications
event speaker icon
Igor Shparlinski
event date icon
יום חמישי, 29.3.2007, 14:30
event location icon
חדר 337-8 טאוב.
A Combinatorial, Primal-Dual approach to Semidefinite Programs
event speaker icon
Sanjeev Arora
event date icon
יום ראשון, 25.3.2007, 14:30
event location icon
חדר 337-8 טאוב.
On the Separation and Equivalence of Paging Strategies: LRU is the sole optimum
event speaker icon
Alex Lopez-Ortiz
event date icon
יום חמישי, 15.3.2007, 14:40
event location icon
חדר 337-8 טאוב.
On the Separation and Equivalence of Paging Strategies: LRU is the sole optimum
event speaker icon
Alex Lopez-Ortiz
event date icon
יום חמישי, 15.3.2007, 14:30
event location icon
חדר 337-8 טאוב.
Scaling up engineering practices to large software companies - the pursuit after quality and agility
event speaker icon
Ariel Katz
event date icon
יום שלישי, 13.3.2007, 14:30
event location icon
חדר 337-8 טאוב.
CGCExplorer: A Semi-Automated Search Procedure for Provably Correct Concurrent Collectors
event speaker icon
Eran Yahav RESCHEDULED
event date icon
יום רביעי, 7.3.2007, 11:00
event location icon
חדר 337-8 טאוב.
A new lower bound on Klarner's constant
event speaker icon
Gill Barequet
event date icon
יום שלישי, 13.2.2007, 14:30
event location icon
חדר 337-8 טאוב.
Competitive Evaluation of Switch Architectures
event speaker icon
דוד חי
event date icon
יום שני, 12.2.2007, 15:30
event location icon
טאוב 701
To support the growing need for Internet bandwidth, contemporary backbone routers and switches operate with an external rate of 20 GB/s and hundreds of ports. At the same time, applications with stringent quality of service (QoS) requirements demand powerful control mechanisms, such as packet scheduling and queue management algorithms. In this talk we discuss an analytic methodology for evaluating such switches by a worst-case comparison of the switch performance relative to an ideal output-queued switch, ...
[לנוסח המלא]
The Complexity of Online Memory Checking
event speaker icon
Guy Rothblum
event date icon
יום שלישי, 6.2.2007, 14:30
event location icon
חדר 337-8 טאוב.
On Games, Multicast Cost Sharing, and Nash Equilibria
event speaker icon
Howard Karloff
event date icon
יום ראשון, 4.2.2007, 14:30
event location icon
חדר 337-8 טאוב.
Throughput Maximization in Wireless Networks via Partitioning and Randomization
event speaker icon
Gil Zussman
event date icon
יום חמישי, 1.2.2007, 14:30
event location icon
חדר 337-8 טאוב.
Statistically-Hiding Commitment from Any One-Way Function
event speaker icon
Iftach Haitner
event date icon
יום שלישי, 30.1.2007, 14:30
event location icon
חדר 337-8 טאוב.
On The Cover Time and Mixing Time of Random Geometric Graphs
event speaker icon
Chen Avin
event date icon
יום חמישי, 25.1.2007, 14:30
event location icon
חדר 337-8 טאוב.
Theory of Computation as a Lens on the Sciences: The Example of Computational Molecular Biology
event speaker icon
Richard M. Karp SPECIAL TALK
event date icon
יום רביעי, 24.1.2007, 12:30
event location icon
CS טאוב Build. Auditorium 2
Submitting locally and running globally - The GLOW and OSG Experience
event speaker icon
Miron Livny
event date icon
יום חמישי, 18.1.2007, 14:30
event location icon
חדר 337-8 טאוב.
Selfishness and Incentives in Networked Systems
event speaker icon
Michal Feldman
event date icon
יום שלישי, 16.1.2007, 14:30
event location icon
חדר 337-8 טאוב.
The strange geometries of computer science
event speaker icon
James Lee
event date icon
יום חמישי, 11.1.2007, 14:30
event location icon
חדר 337-8 טאוב.
Probabilistic Shape for Outlining Objects
event speaker icon
Gal Elidan
event date icon
יום שלישי, 9.1.2007, 14:30
event location icon
חדר 337-8 טאוב.
Allocating Isolation Levels to Transactions
event speaker icon
Alan Fekete
event date icon
יום חמישי, 4.1.2007, 14:30
event location icon
חדר 337-8 טאוב.
Selfish Agents and Approximation Mechanisms
event speaker icon
Moshe Babaioff
event date icon
יום שלישי, 2.1.2007, 14:30
event location icon
חדר 337-8 טאוב.