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