Sciweavers

293 search results - page 9 / 59
» Possibilistic Networks with Locally Weighted Knowledge Bases
Sort
View
ICN
2005
Springer
14 years 1 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
JSAC
2010
131views more  JSAC 2010»
13 years 6 months ago
Joint synchronization and localization using TOAs: A linearization based WLS solution
—Joint synchronization and localization using time of arrival (TOA) measurements is a very important research topic for many wireless ad hoc sensor network applications. For such...
Shouhong Zhu, Zhiguo Ding
CVPR
2011
IEEE
13 years 3 months ago
Cross-View Action Recognition via View Knowledge Transfer
In this paper, we present a novel approach to recognizing human actions from different views by view knowledge transfer. An action is originally modelled as a bag of visual-words ...
Jingen Liu
UAI
2000
13 years 9 months ago
Exploiting Qualitative Knowledge in the Learning of Conditional Probabilities of Bayesian Networks
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
Frank Wittig, Anthony Jameson
AINA
2005
IEEE
14 years 1 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko