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