דילוג לניווט ראשי
דילוג לחיפוש
דילוג לתוכן הראשי
אוניברסיטת אריאל בשומרון בית
עזרה ושאלות נפוצות
English
עברית
العربية
בית
פרופילים
יחידות מחקר
ציוד
פרסומים מחקריים
פרסים
פעילויות
עיתונות/תקשורת
חיפוש לפי מומחיות, שם או שיוך
הצגת פרופיל Scopus
דנה שפירא
פרופ'
דיקן
,
מדעי המחשב
פרופסור מן המניין
,
מדעי המחשב
https://orcid.org/0000-0002-2320-9064
2000 …
2026
פעילות מחקר לפי שנה
סקירה כללית
טביעת אצבע
רשת
פרסומים מחקריים
(124)
פרופילים דומים
(4)
טביעת אצבע
תחומי מחקר אלו נובעים מהפרסומים המדעיים של אדם זה. יחד הם יוצרים טביעת אצבע ייחודית.
מיון לפי
משקל
לפי סדר האלפבית
Keyphrases
Huffman Coding
100%
Huffman
99%
Processing Time
69%
Wavelet Tree
62%
Job Rejection
62%
Fibonacci Codes
58%
Compression Performance
56%
Compression Method
48%
Compressed Pattern Matching
47%
NP-hard
47%
Dynamic Compression
38%
Single Machine
36%
Huffman Tree
35%
Rewriting Codes
34%
Delta Encoding
34%
Dictionary
34%
Edit Distance
34%
Arithmetic Coding
34%
Random Access
32%
Pseudo-polynomial
32%
Huffman Encoding
30%
Delta File
30%
Codeword
29%
Makespan
29%
Compression Efficiency
28%
Rejection Cost
28%
Hurt
27%
Compressed Data
27%
Dynamic Programming
27%
Lot Scheduling
27%
Scheduling Problem
26%
Compression System
25%
Polynomial Dynamics
25%
Context-sensitive
24%
Proportionate Flowshop
24%
Fibonacci
24%
Solution Algorithm
24%
Decompression
23%
Flash Memory
23%
Dynamic Programming Algorithm
23%
Adaptive Huffman Coding
22%
Programming Solution
22%
File Compression
22%
Substring
22%
1-bit
21%
Context-sensitive Rewriting
20%
Source File
20%
Pattern Matching
20%
Encoded Text
20%
Adaptive Coding
20%
Computer Science
Processing Time
82%
Compression Performance
81%
Huffman Coding
73%
Compressed File
61%
Pattern Matching
48%
Random Access
46%
Experimental Result
45%
Flash Memory
41%
Arithmetic Coding
38%
Compressed Form
33%
Compression Efficiency
30%
Data Structure
28%
Constant Factor
28%
Compression Algorithm
27%
Greedy Algorithm
27%
Space Complexity
26%
Approximation (Algorithm)
25%
Sliding Window
24%
Scale-Invariant Feature Transform
20%
Time Complexity
19%
Encoding Length
18%
Single Machine
17%
Feature Vector
17%
Compression Scheme
17%
Dynamic Programming
17%
Dynamic Programming Algorithm
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%
Model Compression
13%
Plaintext Attack
13%
Ciphertext
13%
NP-completeness
13%
Polynomial Time
13%
Information Retrieval
10%
Encryption Method
10%
Completion Time
9%
approximation factor
9%
Mathematics
Huffman
78%
Single Machine
55%
Polynomial
51%
Integer
40%
Numerical Analysis
38%
Upper Bound
38%
Wavelet
37%
Polynomial Time
32%
Huffman Tree
26%
Running Time
24%
Objective Function
24%
Data Structure
22%
Huffman Code
20%
Arithmetic Progression
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%
Natural Number
13%
Single Bit
11%
Weight Function
10%
Input File
10%
Minimizes
9%
Complexity Space
7%
Worst Case
7%
Bit Error
6%
Single Error
6%
Disjoint Set
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%
