Sciweavers

45 search results - page 4 / 9
» Composite hypothesis testing by optimally distinguishable di...
Sort
View
COLT
1995
Springer
13 years 8 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
BMCBI
2008
110views more  BMCBI 2008»
13 years 5 months ago
Testing for treatment effects on gene ontology
In studies that use DNA arrays to assess changes in gene expression, it is preferable to measure the significance of treatment effects on a group of genes from a pathway or functi...
Taewon Lee, Varsha G. Desai, Cruz Velasco, Robert ...
TIT
2011
119views more  TIT 2011»
13 years 4 days ago
Minimax Robust Quickest Change Detection
—The popular criteria of optimality for quickest change detection procedures are the Lorden criterion, the Pollak criterion, and the Bayesian criterion. In this paper, a robust v...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli...
EJWCN
2010
157views more  EJWCN 2010»
13 years 4 days ago
Distributed Power Allocation for Parallel Broadcast Channels with Only Common Information in Cognitive Tactical Radio Networks
A tactical radio network is a radio network in which a transmitter broadcasts the same information to its receivers. In this paper, dynamic spectrum management is studied for multi...
Vincent Le Nir, Bart Scheers
CEC
2008
IEEE
13 years 11 months ago
New evaluation criteria for the convergence of continuous evolutionary algorithms
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
Ying Lin, Jian Huang, Jun Zhang