דילוג לניווט ראשי
דילוג לחיפוש
דילוג לתוכן הראשי
האוניברסיטה הפתוחה בית
עזרה ושאלות נפוצות
English
עברית
العربية
בית
פרופילים
יחידות מחקר
פרסומים מחקריים
פרסים
פעילויות
חיפוש לפי מומחיות, שם או שיוך
מדעי המחשב
האוניברסיטה הפתוחה
המחלקה למתמטיקה ולמדעי המחשב
כתובת דואר
ישראל
סקירה כללית
טביעת אצבע
רשת
פרופילים
(14)
פרסומים מחקריים
(1006)
טביעת אצבע
להלן מוצגים תחומי המחקר שבהם מדעי המחשב פעיל. תחומי מחקר אלו נובעים מהפרסומים המדעיים של חברי הארגון הזה. יחד הם יוצרים טביעת אצבע ייחודית.
מיון לפי
משקל
לפי סדר האלפבית
Keyphrases
Approximation Algorithms
100%
Approximation Ratio
56%
Computer Science
46%
Israel
40%
Connection Problem
32%
Node Connectivity
27%
Minimum Cost
25%
K-connected
24%
Undirected Graph
23%
Open University
23%
Minimum Power
22%
Privacy-preserving
21%
Network Coding
21%
Neuromorphic
20%
Directed Graph
19%
Edge Set
18%
Metric Space
18%
Adversary
18%
Connectivity Augmentation Problem
18%
2-approximation
18%
Face Recognition
16%
Graph Problems
16%
Submodular Maximization
16%
Survivable Networks
16%
Israeli
16%
Improved Approximation
16%
Approximation Guarantee
15%
Wireless Networks
14%
Network Design Problem
13%
Tight
13%
General Graphs
13%
Combinatorial Auctions
12%
Spiking Neural Networks
12%
Edge-connectivity
12%
Incentive Mechanism
12%
Tree Augmentation
11%
Disjoint
11%
Steiner System
11%
High School
11%
Network Problems
11%
K-edge
10%
Edge Cover
10%
Covering Problem
10%
Anonymization
10%
Connected Graph
10%
K-connected Graph
10%
Convolutional Neural Network
10%
Steiner Tree
10%
Index Coding
10%
K-anonymity
10%
NP-hard
10%
Degree Constrained
10%
Anonymity
9%
Log-log
9%
Recommender Systems
9%
Minimum number
9%
Connectivity Augmentation
9%
Survivable Network Design Problem
9%
Polynomial-time Algorithm
9%
Matroid
9%
Edge Coloring
9%
Domain Specific Aspect Languages
9%
Hebrew
9%
Minimum Size
9%
Computer Science Teacher Preparation
9%
Computational Model
9%
2-edge-connected
9%
Steiner Forest
9%
Distributed Algorithms
8%
Dominant Strategy
8%
Connected Subgraphs
8%
Computer Science Teachers
8%
Computer Science Education
8%
Java
8%
Polynomial Time
8%
Augmentation Problem
8%
Multi-sided Markets
8%
Fault-tolerant
8%
Wireless Sensor Networks
8%
Modularity
8%
Flash Memory
8%
LP Relaxation
8%
Programmer
7%
Computer Science Course
7%
Monotone
7%
Language Workbench
7%
Domain-specific Languages
7%
Algorithm Efficiency
7%
Distributed Symmetry Breaking
7%
Deterministic Algorithm
7%
Neural Network
7%
Collaborative Filtering
7%
High School Computer Science
7%
Node Cost
7%
Computer Science Curriculum
7%
High School Curriculum
7%
Modern Hebrew
7%
Graph Coloring
7%
Adversarial Jammer
7%
Network Design
7%
Computer Science
Approximation Algorithms
92%
Approximation (Algorithm)
66%
Approximation Ratio
57%
Subgraphs
47%
Computer Science
45%
Directed Graphs
38%
Connectivity Problem
30%
Network Coding
25%
Network Design Problem
25%
Privacy Preserving
23%
Connected Subgraph
22%
Face Recognition
21%
Connectivity Node
20%
Data Structure
19%
Polynomial Time
19%
Wireless Networks
17%
Secondary Schools
14%
Anonymization
14%
Secret Sharing
13%
Neural Network
12%
Computational Modeling
11%
Coloring Problem
11%
Network Design
10%
Anonymity
10%
Message Passing
10%
Convolutional Neural Network
10%
Fault Tolerant
9%
Domain-specific languages
9%
Distributed Algorithm
9%
Computer Vision
9%
Distributed Computing
9%
Parsing
9%
Syntactics
8%
Social Network
8%
Recommender Systems
8%
Collaborative Filtering
8%
Metric Space
8%
Adversarial Jammer
8%
Electronic Learning
8%
Fundamental Problem
8%
Efficient Algorithm
8%
Maximal Matching
7%
Access Structure
7%
Annotation
7%
Case Study
6%
Obfuscation
6%
Constant Factor
6%
Flash Memory
6%
Aspect-Oriented
6%
Communication Network
6%
Constraint Optimization Problems
6%
Distributed Network
6%
Independent Set
6%
Greedy Algorithm
6%
Maximal Independent Set
6%
Learning System
6%
Machine Learning
6%
Computer Hardware
6%
Action Recognition
6%
Scale-Invariant Feature Transform
6%
Network Capacity
6%
steiner tree
6%
Time Complexity
6%
Privacy Preservation
5%
Polynomial Time Algorithm
5%
Degree Constraint
5%
Primal-Dual
5%
Competitive Ratio
5%
Network Lifetime
5%
Web Application
5%
Experimental Result
5%
Location Problem
5%
Representation Learning
5%
Mechanism Design
5%
Target Function
5%
Aspect-Oriented Programming
5%
Morphological Analysis
5%
Network Traffic
5%
Wireless Sensor Network
5%
approximation scheme
5%
Data Mining
5%
Training Data
5%
Clustering Algorithm
5%
Wireless Network Design
5%
Power Optimization
5%
Learning Process
5%