Sciweavers

301 search results - page 47 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
JMLR
2008
188views more  JMLR 2008»
13 years 6 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
AUTOMATICA
2010
127views more  AUTOMATICA 2010»
13 years 5 months ago
Partitioning datasets based on equalities among parameters
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
Riccardo Porreca, Giancarlo Ferrari-Trecate
GLOBECOM
2010
IEEE
13 years 5 months ago
Cooperation Stimulation in Cognitive Networks Using Indirect Reciprocity Game Modelling
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their ow...
Yan Chen, K. J. Ray Liu
ICSNC
2007
IEEE
14 years 1 months ago
Movement Prediction Using Bayesian Learning for Neural Networks
Nowadays, path prediction is being extensively examined for use in the context of mobile and wireless computing towards more efficient network resource management schemes. Path pr...
Sherif Akoush, Ahmed Sameh
RECOMB
2005
Springer
14 years 7 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...