Sciweavers

293 search results - page 47 / 59
» Possibilistic Networks with Locally Weighted Knowledge Bases
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...
WWW
2003
ACM
14 years 8 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
ICCV
1999
IEEE
14 years 9 months ago
Control in a 3D Reconstruction System using Selective Perception
This paper presents a control structure for general purpose image understanding that addresses both the high level of uncertainty in local hypotheses and the computational complex...
Maurício Marengoni, Allen R. Hanson, Shlomo...
ICC
2009
IEEE
180views Communications» more  ICC 2009»
14 years 2 months ago
Composite Hypothesis Testing for Cooperative Spectrum Sensing in Cognitive Radio
—In this paper, we present a composite hypothesis testing approach for cooperative spectrum sensing. We derive the optimal likelihood ratio test (LRT) statistic based on the Neym...
Sepideh Zarrin, Teng Joon Lim
INFOCOM
2009
IEEE
14 years 2 months ago
Scheduling in Mobile Ad Hoc Networks with Topology and Channel-State Uncertainty
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
Lei Ying, Sanjay Shakkottai