scispace - formally typeset
Search or ask a question
Institution

Technion – Israel Institute of Technology

EducationHaifa, Israel
About: Technion – Israel Institute of Technology is a education organization based out in Haifa, Israel. It is known for research contribution in the topics: Population & Upper and lower bounds. The organization has 31714 authors who have published 79377 publications receiving 2603976 citations. The organization is also known as: Technion Israel Institute of Technology & Ṭekhniyon, Makhon ṭekhnologi le-Yiśraʼel.


Papers
More filters
Journal ArticleDOI
13 Jul 1989-Nature
TL;DR: In this paper, it was pointed out that neutron-star collisions should synthesize neutron-rich heavy elements, thought to be formed by rapid neutron capture (the r-process), and these collisions should produce neutrino bursts and resultant bursts of gamma rays; the latter should comprise a subclass of observable gamma-ray bursts.
Abstract: It is pointed out here that neutron-star collisions should synthesize neutron-rich heavy elements, thought to be formed by rapid neutron capture (the r-process). Furthermore, these collisions should produce neutrino bursts and resultant bursts of gamma rays; the latter should comprise a subclass of observable gamma-ray bursts. It is argued that observed r-process abundances and gamma-ray burst rates predict rates for these collisions that are both significant and consistent with other estimates.

1,986 citations

Journal ArticleDOI
TL;DR: A fast algorithm is derived for the constrained TV-based image deblurring problem with box constraints by combining an acceleration of the well known dual approach to the denoising problem with a novel monotone version of a fast iterative shrinkage/thresholding algorithm (FISTA).
Abstract: This paper studies gradient-based schemes for image denoising and deblurring problems based on the discretized total variation (TV) minimization model with constraints. We derive a fast algorithm for the constrained TV-based image deburring problem. To achieve this task, we combine an acceleration of the well known dual approach to the denoising problem with a novel monotone version of a fast iterative shrinkage/thresholding algorithm (FISTA) we have recently introduced. The resulting gradient-based algorithm shares a remarkable simplicity together with a proven global rate of convergence which is significantly better than currently known gradient projections-based methods. Our results are applicable to both the anisotropic and isotropic discretized TV functionals. Initial numerical results demonstrate the viability and efficiency of the proposed algorithms on image deblurring problems with box constraints.

1,981 citations

Journal ArticleDOI
18 Jul 2014-Science
TL;DR: The experimental realization and operation of dielectric gradient metasurface optical elements capable of also achieving high efficiencies in transmission mode in the visible spectrum are described.
Abstract: Gradient metasurfaces are two-dimensional optical elements capable of manipulating light by imparting local, space-variant phase changes on an incident electromagnetic wave. These surfaces have thus far been constructed from nanometallic optical antennas, and high diffraction efficiencies have been limited to operation in reflection mode. We describe the experimental realization and operation of dielectric gradient metasurface optical elements capable of also achieving high efficiencies in transmission mode in the visible spectrum. Ultrathin gratings, lenses, and axicons have been realized by patterning a 100-nanometer-thick Si layer into a dense arrangement of Si nanobeam antennas. The use of semiconductors can broaden the general applicability of gradient metasurfaces, as they offer facile integration with electronics and can be realized by mature semiconductor fabrication technologies.

1,978 citations

Journal ArticleDOI
TL;DR: This work describes schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database, so that each individual server gets no information on the identity of the item retrieved by the user.
Abstract: Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user's queries and infer what the user is after. Indeed, in cases where the users' intentions are to be kept secret, users are often cautious about accessing the database. It can be shown that when accessing a single database, to completely guarantee the privacy of the user, the whole database should be down-loaded; namely n bits should be communicated (where n is the number of bits in the database).In this work, we investigate whether by replicating the database, more efficient solutions to the private retrieval problem can be obtained. We describe schemes that enable a user to access k replicated copies of a database (k≥2) and privately retrieve information stored in the database. This means that each individual server (holding a replicated copy of the database) gets no information on the identity of the item retrieved by the user. Our schemes use the replication to gain substantial saving. In particular, we present a two-server scheme with communication complexity O(n1/3).

1,918 citations

Journal ArticleDOI
TL;DR: An overview of the theory and currently known techniques for multi-cell MIMO (multiple input multiple output) cooperation in wireless networks is presented and a few promising and quite fundamental research avenues are also suggested.
Abstract: This paper presents an overview of the theory and currently known techniques for multi-cell MIMO (multiple input multiple output) cooperation in wireless networks. In dense networks where interference emerges as the key capacity-limiting factor, multi-cell cooperation can dramatically improve the system performance. Remarkably, such techniques literally exploit inter-cell interference by allowing the user data to be jointly processed by several interfering base stations, thus mimicking the benefits of a large virtual MIMO array. Multi-cell MIMO cooperation concepts are examined from different perspectives, including an examination of the fundamental information-theoretic limits, a review of the coding and signal processing algorithmic developments, and, going beyond that, consideration of very practical issues related to scalability and system-level integration. A few promising and quite fundamental research avenues are also suggested.

1,911 citations


Authors

Showing all 31937 results

NameH-indexPapersCitations
Robert Langer2812324326306
Nicholas G. Martin1921770161952
Tobin J. Marks1591621111604
Grant W. Montgomery157926108118
David Eisenberg156697112460
David J. Mooney15669594172
Dirk Inzé14964774468
Jerrold M. Olefsky14359577356
Joseph J.Y. Sung142124092035
Deborah Estrin135562106177
Bruce Yabsley133119184889
Jerry W. Shay13363974774
Richard N. Bergman13047791718
Shlomit Tarem129130686919
Allen Mincer129104080059
Network Information
Related Institutions (5)
Imperial College London
209.1K papers, 9.3M citations

93% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

92% related

University of Illinois at Urbana–Champaign
225.1K papers, 10.1M citations

92% related

Stanford University
320.3K papers, 21.8M citations

92% related

University of Toronto
294.9K papers, 13.5M citations

92% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023147
2022390
20213,397
20203,526
20193,273
20183,131