تخطي إلى التنقل الرئيسي
تخطي إلى البحث
تخطي إلى المحتوى الرئيسي
الصفحة الرئيسية
المساعدة والأسئلة الشائعة
English
עברית
العربية
الصفحة الرئيسية
الملفات الشخصية
الوحدات البحثية
نتاج البحث
الجوائز
أنشطة
البحث حسب الخبرة أو الاسم أو الانتماء
عرض الملف الشخصي الخاص بـ Scopus
דנה שפירא
Prof.
Dean
,
Department of Computer Science
https://orcid.org/0000-0002-2320-9064
2000
2025
نتاج الأبحاث سنويًا
معاينة
بصمة
الشبكة
نتاج البحث
(117)
ملفات شخصية مماثلة
(4)
بصمة
تأتي تسميات الموضوعات هذه من أعمال هذا الشخص. فهما يشكلان معًا بصمة فريدة.
فرز حسب
الوزن
أبجديًا
Keyphrases
1-bit
21%
Adaptive Coding
20%
Adaptive Huffman Coding
22%
Arithmetic Coding
31%
Codeword
29%
Compressed Data
27%
Compressed Pattern Matching
47%
Compression Efficiency
29%
Compression Method
48%
Compression Performance
56%
Compression System
25%
Context-sensitive
24%
Context-sensitive Rewriting
20%
Decompression
23%
Delta Encoding
34%
Delta File
30%
Dictionary
34%
Dynamic Compression
38%
Dynamic Programming
22%
Dynamic Programming Algorithm
21%
Edit Distance
34%
Encoded Text
20%
Fibonacci
24%
Fibonacci Codes
58%
File Compression
22%
Flash Memory
23%
Huffman
100%
Huffman Coding
96%
Huffman Encoding
30%
Huffman Tree
36%
Hurt
27%
Job Rejection
59%
Makespan
22%
NP-hard
47%
Pattern Matching
20%
Polynomial Dynamics
22%
Preprocessing Techniques
20%
Processing Time
66%
Proportionate Flowshop
24%
Pseudo-polynomial
29%
Random Access
32%
Rejection Cost
25%
Rewriting Codes
34%
Scheduling Problem
23%
Single Machine
29%
Skewed Distribution
20%
Solution Algorithm
20%
Source File
20%
Substring
22%
Wavelet Tree
63%
Computer Science
Anomaly Detection
13%
Approximation (Algorithm)
25%
approximation factor
9%
Arithmetic Coding
31%
Arithmetic Progression
13%
Code Construction
13%
Completion Time
9%
Compressed Data
13%
Compressed File
61%
Compressed Form
33%
Compression Algorithm
27%
Compression Efficiency
30%
Compression Performance
81%
Compression Scheme
17%
Constant Factor
28%
Construction Algorithm
8%
Cryptography
13%
Data Structure
28%
Detection Algorithm
13%
Dynamic Programming
17%
Dynamic Programming Algorithm
16%
Encoding Length
18%
Encryption Method
10%
Experimental Result
45%
Feature Vector
17%
Flash Memory
41%
Greedy Algorithm
27%
Haar Transform
13%
Hierarchical Clustering
13%
Huffman Coding
66%
Information Retrieval
10%
Model Compression
6%
Pattern Matching
48%
Polynomial Time
13%
Preprocessing Stage
13%
Preprocessing Step
8%
Processing Time
82%
Random Access
46%
Scale-Invariant Feature Transform
20%
Single Bit Error
13%
Single Machine
17%
Single Machine Scheduling
13%
Sliding Window
24%
Space Complexity
26%
Text Retrieval System
6%
Time Complexity
19%
Traditional Method
13%
Transmission Error
13%
Underlying File
13%
Update Algorithm
13%
Mathematics
Approximates
6%
Arithmetic Coding
17%
Arithmetic Progression
13%
Bit Error
6%
Complexity Space
7%
Considered Problem
6%
Constant Factor
19%
Cost Function
6%
Data Compression
16%
Data Structure
21%
Decoding Error
6%
Decoding Procedure
6%
Dependent Data
13%
Disjoint Set
6%
Greedy Algorithm
6%
Haar Transform
6%
Huffman
79%
Huffman Code
20%
Huffman Tree
26%
Input Data
16%
Input File
10%
Integer
40%
Lower and upper bounds
13%
Minimizes
6%
Natural Number
13%
Numerical Analysis
38%
Objective Function
10%
Ordinary Sense
13%
Partitioning Problem
6%
Performance Measure
13%
Polynomial
47%
Polynomial Time
27%
Probability Distribution
6%
Probability Theory
6%
Real Life
13%
Recursive Sequences
6%
Rejection Method
6%
Relative Efficiency
6%
Running Time
24%
Scheduling Theory
6%
Single Bit
11%
Single Error
6%
Single Machine
48%
Skewed Distribution
13%
Standard Deviation
6%
Universal Code
13%
Upper Bound
34%
Variable Length
17%
Wavelet
37%
Weight Function
10%
