דילוג לניווט ראשי
דילוג לחיפוש
דילוג לתוכן הראשי
אוניברסיטת אריאל בשומרון בית
עזרה ושאלות נפוצות
English
עברית
العربية
בית
פרופילים
יחידות מחקר
פרסומים מחקריים
פרסים
פעילויות
חיפוש לפי מומחיות, שם או שיוך
הצגת פרופיל Scopus
ליעד גוטליב
פרופ'
https://orcid.org/0000-0003-3355-351X
2003
2025
פעילות מחקר לפי שנה
סקירה כללית
טביעת אצבע
רשת
פרסומים מחקריים
(54)
פרופילים דומים
(6)
טביעת אצבע
תחומי מחקר אלו נובעים מהפרסומים המדעיים של אדם זה. יחד הם יוצרים טביעת אצבע ייחודית.
מיון לפי
משקל
לפי סדר האלפבית
Keyphrases
Metric Space
70%
Dimensionality Reduction
49%
Doubling Dimension
49%
Euclidean Space
32%
Intrinsic Dimension
28%
Doubling Constant
28%
General Metric Spaces
27%
Support Vector Machine
24%
Traveling Salesman Problem
23%
Generalization Bounds
23%
Doubling Spaces
22%
Polynomial-time Approximation Scheme
22%
Approximate Nearest Neighbor Search
21%
Low Dimensionality
21%
Target Dimension
21%
Optimal Sample
21%
Sample Compression
21%
Nearly Optimal
21%
Lipschitz Extension
21%
Nearest Neighbor
21%
Label Size
18%
Update Time
18%
Proximity Algorithm
14%
Matrix Sparsification
14%
Distance Labeling
14%
Space Problem
14%
Null Space
14%
Nonlinear Methods
14%
Dimension Bounds
14%
Snowflake Metric
14%
Spanners
14%
Class Function
14%
Adaptive Metric
14%
Metric Data
14%
Efficient Classification
14%
Semi-metric
14%
Ionospheric Total Electron Content
14%
Semimetric Space
14%
Dens
14%
Time Approximation
14%
Approximation Scheme
14%
Near-optimal
14%
Cardinality
14%
Polytope
14%
Fully Dynamic
14%
Compression Algorithms
14%
Polyhedron
14%
Barycentric Coordinate System
14%
Explicit Feature Maps
14%
P-space
13%
Mathematics
Metric Space
100%
Nearest Neighbor
60%
Approximates
55%
Set Point
47%
Euclidean Space
42%
Open Problem
34%
Polynomial Time
29%
Edge
24%
Traveling Salesman Problem
23%
Lindenstrauss
21%
Cardinality
21%
Linear Time
21%
Bicriteria
14%
Null
14%
Worst Case
14%
Lp-Spaces
14%
Semimetric Space
14%
Matrix (Mathematics)
14%
Polytope
14%
Total Length
14%
Barycentric Coordinate
14%
Polyhedron
14%
Dimensionality Reduction
14%
Probability Theory
10%
Data Structure
10%
Nonuniform
10%
Regressors
10%
Linear Function
9%
piecewise linear
9%
Minimum Spanning Tree
9%
Bounded Number
7%
Orthogonal Vector
7%
Orthogonal Function
7%
Binomial Coefficient
7%
Product Space
7%
Empirical Process
7%
Error Bound
7%
L1 Space
7%
Minimization Problem
7%
Center Point
7%
Orienteering Problem
7%
Finite Metric Space
7%
Convex Polyhedron
7%
Constant Coefficient
7%
Runge-Kutta Method
7%
Neural Network
7%
Dimensional Space
7%
Preserving Property
7%
Time Discretization
7%
Lipschitz Constant
7%
Computer Science
Metric Space
77%
Neighbour Search
28%
Approximation (Algorithm)
24%
Intrinsic Dimensionality
16%
Performance Bound
14%
Compression Algorithm
14%
Sparse Approximation
14%
Coordinate System
14%
piecewise linear
14%
near neighbor classification
14%
Feature Map
14%
Performance Guarantee
14%
Linear Function
11%
Generalization Performance
10%
Neural Network
9%
Linear Classifier
8%
Fundamental Problem
7%
Preprocessing Time
7%
Single Solution
7%
Embedding Distortion
7%
Efficient Implementation
7%
Decision Boundary
7%
Data Structure
7%
Good Approximation
7%
Classical Problem
7%
Hilbert Space
7%
Classification Performance
7%
Computational Efficiency
7%
Information Storage
7%
steiner tree
7%
Lower Dimensional Space
7%
Time Approximation Scheme
7%
Computer Science
7%
routing scheme
7%
Dimensionality Reduction
7%
Multiclass Classification
7%
min-sum algorithm
7%
k-Nearest Neighbors Algorithm
7%
Convolutional Neural Network
7%
Runtime Complexity
5%
Risk Minimization
5%
Large Data Set
5%
Convex Programming
5%
Naïve Approach
5%
Sparse Representation
5%
