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
TL;DR: Gastric leak is the most common cause of major morbidity and mortality after LSG, and routine tests to rule out leaks seem to be superfluous.
Abstract: Background Laparoscopic sleeve gastrectomy (LSG) remains under scrutiny as a stand-alone bariatric procedure. The most feared complication after LSG is staple line leak.

343 citations

Journal ArticleDOI
TL;DR: A comprehensive mutational analysis of the all known genes in 179 unrelated LCA patients, including 52 familial and 127 sporadic (27/127 consanguineous) cases, and decisional flowcharts directing the molecular analysis of LCA genes in a given case are drawn.
Abstract: Leber congenital amaurosis (LCA) is the earliest and most severe form of all inherited retinal dystrophies, responsible for congenital blindness. Disease-associated mutations have been hitherto reported in seven genes. These genes are all expressed preferentially in the photoreceptor cells or the retinal pigment epithelium but they are involved in strikingly different physiologic pathways resulting in an unforeseeable physiopathologic variety. This wide genetic and physiologic heterogeneity that could largely increase in the coming years, hinders the molecular diagnosis in LCA patients. The genotyping is, however, required to establish genetically defined subgroups of patients ready for therapy. Here, we report a comprehensive mutational analysis of the all known genes in 179 unrelated LCA patients, including 52 familial and 127 sporadic (27/127 consanguineous) cases. Mutations were identified in 47.5% patients. GUCY2D appeared to account for most LCA cases of our series (21.2%), followed by CRB1 (10%), RPE65 (6.1%), RPGRIP1 (4.5%), AIPL1 (3.4%), TULP1 (1.7%), and CRX (0.6%). The clinical history of all patients with mutations was carefully revisited to search for phenotype variations. Sound genotype-phenotype correlations were found that allowed us to divide patients into two main groups. The first one includes patients whose symptoms fit the traditional definition of LCA, i.e., congenital or very early cone-rod dystrophy, while the second group gathers patients affected with severe yet progressive rod-cone dystrophy. Besides, objective ophthalmologic data allowed us to subdivide each group into two subtypes. Based on these findings, we have drawn decisional flowcharts directing the molecular analysis of LCA genes in a given case. These flowcharts will hopefully lighten the heavy task of genotyping new patients but only if one has access to the most precise clinical history since birth.

343 citations

Journal ArticleDOI
TL;DR: This work presents a novel technique for texture mapping on arbitrary surfaces with minimal distortion by preserving the local and global structure of the texture by solving an "inverse" problem and map a flat texture patch onto a curved surface while preserving the structure ofThe texture.
Abstract: Presents a novel technique for texture mapping on arbitrary surfaces with minimal distortion by preserving the local and global structure of the texture. The recent introduction of the fast marching method on triangulated surfaces has made it possible to compute a geodesic distance map from a given surface point in O(n lg n) operations, where n is the number of triangles that represent the surface. We use this method to design a surface flattening approach based on multi-dimensional scaling (MDS). MDS is a family of methods that map a set of points into a finite-dimensional flat (Euclidean) domain, where the only data given is the corresponding distance between every pair of points. The MDS mapping yields minimal changes of the distances between the corresponding points. We then solve an "inverse" problem and map a flat texture patch onto a curved surface while preserving the structure of the texture.

343 citations

Journal ArticleDOI
TL;DR: In this paper, the authors present a maintenance framework that shows management cycles of maintenance activities during the product life cycle, identifying technical issues of maintenance and discuss the advances of technologies supporting the change in the role of maintenance.

343 citations

Proceedings ArticleDOI
03 Jan 1991
TL;DR: The authors demonstrate that any functionf whose L -norm is polynomial can be approximated by a polynomially sparse function, and prove that boolean decision trees with linear operations are a subset of this class of functions.
Abstract: This work gives apolynomial time algorithm for learning decision trees with respect to the uniform distribution (This algorithm uses membership queries) The decision tree model that is considered is an extension of the traditional boolean decision tree model that allows linear operations in each node (ie, summation of a subset of the input variables over GF(2)) This paper shows how to learn in polynomial time any function that can be approximated (in norm L2) by a polynomially sparse function (ie, a function with only polynomially many nonzero Fourier coefficients) The authors demonstrate that any functionf whose L -norm (ie, the sum of absolute value of the Fourier coefficients) is polynomial can be approximated by a polynomially sparse function, and prove that boolean decision trees with linear operations are a subset of this class of functions Moreover, it is shown that the functions with polynomial L -norm can be learned deterministically The algorithm can also exactly identify a decision tree of depth d in time polynomial in 2 a and n This result implies that trees of logarithmic depth can be identified in polynomial time

343 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