Sciweavers

177 search results - page 26 / 36
» Fast Simulation of Realistic Trees
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
13 years 9 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
CSDA
2006
100views more  CSDA 2006»
13 years 8 months ago
Identification of interaction patterns and classification with applications to microarray data
Emerging patterns represent a class of interaction structures which has been recently proposed as a tool in data mining. In this paper, a new and more general definition refering ...
Anne-Laure Boulesteix, Gerhard Tutz
TIT
1998
86views more  TIT 1998»
13 years 8 months ago
A Sequential Decoder for Linear Block Codes with a Variable Bias-Term Metric
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
Vladislav Sorokine, Frank R. Kschischang
BMCBI
2005
134views more  BMCBI 2005»
13 years 8 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001
ATAL
2009
Springer
14 years 3 months ago
Generalized model learning for reinforcement learning in factored domains
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
Todd Hester, Peter Stone