Sciweavers

5056 search results - page 463 / 1012
» Network Coding Theory
Sort
View
108
Voted
ICMCS
2009
IEEE
85views Multimedia» more  ICMCS 2009»
15 years 2 months ago
Text-independent compressed domain speaker verification for digital communication networks call monitoring
In this paper we present a text-independent automatic speaker verification system that works in the compressed domain using GSM AMR coded speech. While traditional approaches proc...
Matteo Petracca, Antonio Servetti, Juan Carlos De ...
MOBIHOC
2006
ACM
16 years 4 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
MOBIHOC
2003
ACM
16 years 4 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
IPSN
2009
Springer
15 years 11 months ago
Automating rendezvous and proxy selection in sensornets
As the diversity of sensornet use cases increases, the combinations of environments and applications that will coexist will make custom engineering increasingly impractical. We in...
David Chu, Joseph M. Hellerstein
IMC
2009
ACM
15 years 11 months ago
An analysis of packet sampling in the frequency domain
Packet sampling techniques introduce measurement errors that should be carefully handled in order to correctly characterize the network behavior. In the literature several works h...
Luigi Alfredo Grieco, Chadi Barakat