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