2010 CS Technical Reports

• CS-2010-01 Yehuda Pfeffer and Michael Zibulevsky: A Micro-Mirror Array based System for Compressive Sensing of Hyperspectral Data
• CS-2010-02 Yaron Kanza, Roy Levin, Eliyahu Safra and Yehoshua Sagiv: Interactive Route Search in the Presence of Order Constraints
• CS-2010-03 Yehuda Pfeffer and Michael Zibulevsky: Sampling and Noise in Compressive Sensing
• CS-2010-04 Alex Kogan: On Porting iperf to Windows Mobile and Adding BlueTooth Support
• CS-2010-05 Fanica Gavril: Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
• CS-2010-06 Sonya Liberman and Shaul Markovitch: Wikipedia-based Compact Hierarchical Semantics with Application to Semantic Relatedness
• CS-2010-07 George B. Mertzios, Ignasi Sau, Mordechai Shalom, and Shmuel Zaks: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
• CS-2010-08 Tamir Levi and Ami Litman: Bitonic sorters of minimal depth
• CS-2010-09 Fanica GAVRIL: Cliques and independent packings in complements of H-mixed graphs
• CS-2010-10 Eliyahu Osherovich, Michael Zibulevsky, and Irad Yavneh: Simultaneous deconvolution and phase retrieval from noisy data
• CS-2010-11 Hagit Attiya and Eshcar Hillel: The Cost of Privatization
• CS-2010-12 Roman Zeyde, Matan Protter and Michael Elad: On Single Image Scale-Up using Sparse-Representation
• CS-2010-13 Michael Zibulevsky: How to inhibit destructive positive feedback in time of economic crisis
• CS-2010-14 Javier Turek, Irad Yavneh, Matan Protter, and Michael Elad: On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary
• CS-2010-15 Eliyahu Osherovich, Michael Zibulevsky, and Irad Yavneh: Numerical Solution of Inverse Problems in Optics: Phase Retrieval, Holography, Deblurring, Image Reconstruction From Its Defocused Versions, And Combinations Thereof.
• CS-2010-16 Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: ptimizing Regenerator Cost in Traffic Grooming
• CS-2010-17 George B. Mertzios: The Recognition of Triangle Graphs
• CS-2010-18 George B. Mertzios and Ivona Bezakova: Computing and Counting the Longest Paths on Circular-Arc Graphs in Polynomial Time
• CS-2010-19 Dariusz R. Kowalski, George B. Mertzios, Mariusz Rokicki, Mordechai Shalom, Prudence W.H. Wong, Fencol C.C. Yung, and Shmuel Zaks: Regenerator Cost Optimization in Path Networks With Traffic Grooming
• CS-2010-20 Fanica Gavril: Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs(Revised Version)
• CS-2010-21 Fanica Gavril: Algorithms for induced biclique optimization problems
• CS-2010-22 Eliyahu Osherovich, Michael Zibulevsky, and Irad Yavneh: Algorithms for phase retrieval with a (rough) phase estimate available: a comparison
• CS-2010-23 Raja Giryes and Michael Elad: RIP-Based Near-Oracle Performance Guarantees for Subspace-Pursuit, CoSaMP, and Iterative Hard-Thresholding