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
Book ChapterDOI
12 Oct 2015
TL;DR: This paper proposes the triplet network model, which aims to learn useful representations by distance comparisons, and demonstrates using various datasets that this model learns a better representation than that of its immediate competitor, the Siamese network.
Abstract: Deep learning has proven itself as a successful set of models for learning useful semantic representations of data. These, however, are mostly implicitly learned as part of a classification task. In this paper we propose the triplet network model, which aims to learn useful representations by distance comparisons. A similar model was defined by Wang et al. (2014), tailor made for learning a ranking for image information retrieval. Here we demonstrate using various datasets that our model learns a better representation than that of its immediate competitor, the Siamese network. We also discuss future possible usage as a framework for unsupervised learning.

1,635 citations

Proceedings ArticleDOI
23 Oct 1995
TL;DR: Schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database and get no information on the identity of the item retrieved by the user are described.
Abstract: We describe schemes that enable a user to access k replicated copies of a database (k/spl ges/2) and privately retrieve information stored in the database. This means that each individual database gets no information on the identity of the item retrieved by the user. For a single database, achieving this type of privacy requires communicating the whole database, or n bits (where n is the number of bits in the database). Our schemes use the replication to gain substantial saving. In particular, we have: A two database scheme with communication complexity of O(n/sup 1/3/). A scheme for a constant number, k, of databases with communication complexity O(n/sup 1/k/). A scheme for 1/3 log/sub 2/ n databases with polylogarithmic (in n) communication complexity.

1,630 citations

Journal ArticleDOI
TL;DR: Data collected demonstrate that there is a strong association between GBA mutations and Parkinson's disease, and those with a GBA mutation presented earlier with the disease, were more likely to have affected relatives, and were morelikely to have atypical clinical manifestations.
Abstract: Background Recent studies indicate an increased frequency of mutations in the gene encoding glucocerebrosidase (GBA), a deficiency of which causes Gaucher's disease, among patients with Parkinson's disease. We aimed to ascertain the frequency of GBA mutations in an ethnically diverse group of patients with Parkinson's disease. Methods Sixteen centers participated in our international, collaborative study: five from the Americas, six from Europe, two from Israel, and three from Asia. Each center genotyped a standard DNA panel to permit comparison of the genotyping results across centers. Genotypes and phenotypic data from a total of 5691 patients with Parkinson's disease (780 Ashkenazi Jews) and 4898 controls (387 Ashkenazi Jews) were analyzed, with multivariate logistic-regression models and the Mantel–Haenszel procedure used to estimate odds ratios across centers. Results All 16 centers could detect two GBA mutations, L444P and N370S. Among Ashkenazi Jewish subjects, either mutation was found in 15% of p...

1,629 citations

Journal ArticleDOI
TL;DR: Bound states in the continuum (BICs) are waves that remain localized even though they coexist with a continuous spectrum of radiating waves that can carry energy away.
Abstract: Bound states in the continuum (BICs) are waves that remain localized even though they coexist with a continuous spectrum of radiating waves that can carry energy away. Their very existence defies conventional wisdom. Although BICs were first proposed in quantum mechanics, they are a general wave phenomenon and have since been identified in electromagnetic waves, acoustic waves in air, water waves and elastic waves in solids. These states have been studied in a wide range of material systems, such as piezoelectric materials, dielectric photonic crystals, optical waveguides and fibres, quantum dots, graphene and topological insulators. In this Review, we describe recent developments in this field with an emphasis on the physical mechanisms that lead to BICs across seemingly very different materials and types of waves. We also discuss experimental realizations, existing applications and directions for future work. The fascinating wave phenomenon of ‘bound states in the continuum’ spans different material and wave systems, including electron, electromagnetic and mechanical waves. In this Review, we focus on the common physical mechanisms underlying these bound states, whilst also discussing recent experimental realizations, current applications and future opportunities for research.

1,612 citations

Book ChapterDOI
06 May 2001
TL;DR: In this article, the authors present a formalism for the analysis of key exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys some important analytical benefits: (i) any key exchange protocol that satisfies the security definition can be composed with symmetric encryption and authentication functions to provide provably secure communication channels.
Abstract: We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys some important analytical benefits: (i) any key-exchange protocol that satisfies the security definition can be composed with symmetric encryption and authentication functions to provide provably secure communication channels (as defined here); and (ii) the definition allows for simple modular proofs of security: one can design and prove security of key-exchange protocols in an idealized model where the communication links are perfectly authenticated, and then translate them using general tools to obtain security in the realistic setting of adversary-controlled links. We exemplify the usability of our results by applying them to obtain the proof of two classes of key-exchange protocols, Diffie-Hellman and key-transport, authenticated via symmetric or asymmetric techniques.

1,584 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