Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algorithm (1)
- Algorithms (1)
- Bilingual lexicon induction (BLI) (1)
- Capture (1)
- Computer science (1)
-
- Data communication (1)
- Data compression techniques (1)
- Etymological relationships (1)
- Graph (1)
- Intra-space and interspace topological relations (1)
- Isomorphic assumption (1)
- Linear mapping matrix (1)
- Localization (1)
- MUSE dataset (1)
- Mapping function (1)
- Natural language processing (1)
- Network protocols (1)
- Orthogonality constraint (1)
- Pipelining (1)
- Sensor networks (1)
- Topology control (1)
- Training (1)
- Wireless sensor networks (1)
- Words (1)
Articles 1 - 4 of 4
Full-Text Articles in Computer Engineering
A Structure-Aware Generative Adversarial Network For Bilingual Lexicon Induction, Bocheng Han, Qian Tao, Lusi Li, Zhihao Xiong
A Structure-Aware Generative Adversarial Network For Bilingual Lexicon Induction, Bocheng Han, Qian Tao, Lusi Li, Zhihao Xiong
Computer Science Faculty Publications
Bilingual lexicon induction (BLI) is the task of inducing word translations with a learned mapping function that aligns monolingual word embedding spaces in two different languages. However, most previous methods treat word embeddings as isolated entities and fail to jointly consider both the intra-space and inter-space topological relations between words. This limitation makes it challenging to align words from embedding spaces with distinct topological structures, especially when the assumption of isomorphism may not hold. To this end, we propose a novel approach called the Structure-Aware Generative Adversarial Network (SA-GAN) model to explicitly capture multiple topological structure information to achieve accurate …
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Computer Science Faculty Publications
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices, referred to as sensors, will be mass-produced and deployed, making their production cost negligible. Due to their small form factor and modest non-renewable energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. …
Introduction: Data Communication And Topology Algorithms For Sensor Networks, Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic
Introduction: Data Communication And Topology Algorithms For Sensor Networks, Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic
Computer Science Faculty Publications
(First paragraph) We are very proud and honored to have been entrusted to be Guest Editors for this special issue. Papers were sought to comprehensively cover the algorithmic issues in the “hot” area of sensor networking. The concentration was on network layer problems, which can be divided into two groups: data communication problems and topology control problems. We wish to briefly introduce the five papers appearing in this special issue. They cover specific problems such as time division for reduced collision, fault tolerant clustering, self-stabilizing graph optimization algorithms, key pre-distribution for secure communication, and distributed storage based on spanning trees …
Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala
Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala
Computer Science Faculty Publications
Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.