Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
message compression
Description:
The reduction of message size or communication overhead through encoding or algorithmic techniques, studied in networking and distributed computing.
Related topics:
Service-Oriented Architecture and Web Services (8%),
Algorithms and Data Compression (7%)
OpenAlex ID:
keywords/message-compression
Securing the Internet of Things: A Standardization Perspective
2014
·
Sye Loong Keoh
, Sandeep S. Kumar
, et al.
·
IEEE Internet of Things Journal
·
537
Flow Event Telemetry on Programmable Data Plane
2020
·
Yu Zhou
, Chen Sun
, et al.
·
ACM SIGCOMM Conference (SIGCOMM)
·
177
A Direct Sum Theorem in Communication Complexity via Message Compression
2003
·
Rahul Jain
, Jaikumar Radhakrishnan
, et al.
·
Lecture notes in computer science
·
130
PDF
Apache Kafka
2013
·
Nishant Garg
·
116
Signaling Compression (SigComp)
2003
·
R. Price
, C. Bormann
, et al.
·
81
Public vs Private Coin in Bounded-Round Information
2014
·
Mark Braverman
, Ankit Garg
·
Lecture notes in computer science
·
78
Tailoring density estimation via reproducing kernel moment matching
2008
·
Le Song
, Xinhua Zhang
, et al.
·
International Conference on Machine Learning
·
75
Prior Entanglement, Message Compression and Privacy in Quantum Communication
2005
·
Rahul Jain
, J. Radhakrishnan
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
73
Pushing the SOAP Envelope with Web Services for Scientific Computing.
2003
·
Robert van Engelen
·
IEEE International Conference on Web Services (ICWS)
·
73
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
2004
·
A. Chakrabarti
, O. Regev
·
Annual Symposium on Foundations of Computer Science
·
70
Compressing SOAP messages by using differential encoding
2004
·
C. Werner
, C. Buschmann
·
IEEE International Conference on Web Services (ICWS)
·
66
Producing a One-Way Hash Function from DES
1984
·
Robert S. Winternitz
·
Springer eBooks
·
63
Compressed-VFL: Communication-Efficient Learning with Vertically Partitioned Data
2022
·
Castiglia, Timothy
, Das, Anirban
, et al.
·
arXiv (Cornell University)
·
62
PDF
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions
2014
·
Rahul Jain
, Attila Pereszlenyi
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
56
PDF
Efficient Message Representations for Belief Propagation
2007
·
Tianli Yu
, Ruei-Sung Lin
, et al.
·
IEEE/CVF International Conference on Computer Vision (ICCV)
·
52
Semantic Information Recovery in Wireless Networks
2023
·
Edgar Beck
, Carsten Bockelmann
, et al.
·
Sensors
·
51
PDF
Hardware module-based message authentication in intra-vehicle networks
2017
·
Eric Wang
, William Xu
, et al.
·
ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS)
·
50
A High-Throughput Trellis-Based Layered Decoding Architecture for Non-Binary LDPC Codes Using Max-Log-QSPA
2013
·
Yeong-Luh Ueng
, Kuo-Hsuan Liao
, et al.
·
IEEE Transactions on Signal Processing
·
48
A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity
2012
·
Rahul Jain
, Attila Pereszlenyi
, et al.
·
Annual Symposium on Foundations of Computer Science
·
47
High-performance telepointers
2004
·
Jeff Dyck
, Carl Gutwin
, et al.
·
ACM Conference on Computer Supported Cooperative Work (CSCW)
·
44
Performance evaluation of SIP-based multimedia services in UMTS
2005
·
Dirk Pesch
, Maria Isabel Pous
, et al.
·
Computer Networks
·
42
Unused resources in global maritime distress safety system: digital selective call
2021
·
В.В. Демидкин
·
МОРСКИЕ ИНТЕЛЛЕКТУАЛЬНЫЕ ТЕХНОЛОГИИ
·
41
PDF
Analysis of Different Steganographic Algorithms for Secured Data Hiding
2010
·
M.G. Umamaheswari
, S. Sivasubramanian
, et al.
·
41
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
2008
·
Jain, Rahul
, Sen, Pranab
, et al.
·
arXiv (Cornell University)
·
41
PDF
Runtime Compression of MPI Messanes to Improve the Performance and Scalability of Parallel Applications
2005
·
Jian Ke
, M. Burtscher
, et al.
·
ACM/IEEE Conference on Supercomputing (SC)
·
40
Show more works
View as search
Works count:
364
Citation count:
3,708
Year
Topic
Type