Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

V. Manzella

dblp:36/3525 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 100%
Theoretical computer science
1 paper
Coding theory · 77% Information theory · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Environmental and earth informatics · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
wireless sensor network
0.212013
Plants as sensing devices: the PLEASED experience · SenSys 2013
Environmental and earth informatics
environmental monitoring
0.012013
Plants as sensing devices: the PLEASED experience · SenSys 2013
Coding theory › joint source-channel coding
channel-optimized vector quantization
0.011994
Asymptotic bounds on optimal noisy channel optimization via random coding · IEEE Trans. Inf. Theory 1994
Information theory › communication channels › channel models
noisy channel
0.011994
Asymptotic bounds on optimal noisy channel optimization via random coding · IEEE Trans. Inf. Theory 1994
Coding theory › source coding
rate-distortion theory
0.011994
Asymptotic bounds on optimal noisy channel optimization via random coding · IEEE Trans. Inf. Theory 1994
Coding theory › source coding › quantization
vector quantization
0.011994
Asymptotic bounds on optimal noisy channel optimization via random coding · IEEE Trans. Inf. Theory 1994
Coding theory › source coding › quantization › vector quantization
index assignment
0.011994
Asymptotic bounds on optimal noisy channel optimization via random coding · IEEE Trans. Inf. Theory 1994

Methods — techniques the papers use, named apart from their topics

biosensing · 0.3random coding · 0.0high-resolution analysis · 0.0
YearPublicationVenuePosition
2013 Plants as sensing devices: the PLEASED experience
abstract
In this paper we discuss the first results of the PLEASED project [1] which aims at employing plants as biosensors of a new generation of pervasive and organic wireless sensor networks.
V. Manzella, Claudio Roberto Gaz, Andrea Vitaletti, Elisa Masi, Luisa Santopolo, Stefano Mancuso, D. Salazar, J. J. de las Heras
SenSys1
1994 Asymptotic bounds on optimal noisy channel optimization via random coding
abstract
Asymptotically optimal zero-delay vector quantization in the presence of channel noise is studied using random coding techniques. First, an upper bound is derived for the average rth-power distortion of channel optimized k-dimensional vector quantization at transmission rate R on a binary symmetric channel with bit error probability /spl epsiv/. The upper bound asymptotically equals 2/sup -rRg(/spl epsiv/,k,r/). where k/(k +r) [1 - log/sub 2/(l +2/spl radic/(/spl epsiv/(1-/spl epsiv/))] /spl les/g(/spl epsiv/,k,r)/spl les/1) for all /spl epsiv//spl ges/0, lim/sub /spl epsiv//spl rarr/0/g(/spl epsiv/,k,r)=1, and lim/sub k/spl rarr//spl infin//g(/spl epsiv/,k,r)=1. Numerical computations of g(/spl epsiv/,k,r) are also given. This result is analogous to Zador's (1982) asymptotic distortion rate of 2/sup -rR/ for quantization on noiseless channels. Next, using a random coding argument on nonredundant index assignments, a useful upper bound is derived in terms of point density functions, on the minimum mean squared error of high resolution, regular, vector quantizers in the presence of channel noise. The formula provides an accurate approximation to the distortion of a noisy channel quantizer whose codebook is arbitrarily ordered. Finally, it is shown that the minimum mean squared distortion of a regular, noisy channel VQ with a randomized nonredundant index assignment, is, in probability, asymptotically bounded away from zero.>
Kenneth Zeger, V. Manzella
IEEE Trans. Inf. Theory2