Sciweavers

62 search results - page 5 / 13
» On Empirical Meaning of Randomness with Respect to a Real Pa...
Sort
View
JCM
2008
94views more  JCM 2008»
13 years 8 months ago
Cell Site Power Characterization for Multi-rate Wireless CDMA Data Networks Using Lognormal Approximation
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
Ashraf S. Hasan Mahmoud
AI
2006
Springer
13 years 8 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
ICPR
2008
IEEE
14 years 2 months ago
Robust indoor activity recognition via boosting
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato
BMCBI
2005
115views more  BMCBI 2005»
13 years 8 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...
TAMC
2010
Springer
14 years 1 months ago
Incremental List Coloring of Graphs, Parameterized by Conservation
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
Sepp Hartung, Rolf Niedermeier