Sciweavers

517 search results - page 37 / 104
» Near-Deterministic Inference of AS Relationships
Sort
View
98
Voted
ICSE
2010
IEEE-ACM
15 years 3 months ago
An eclectic approach for change impact analysis
Change impact analysis aims at identifying software artifacts being affected by a change. In the past, this problem has been addressed by approaches relying on static, dynamic, a...
Michele Ceccarelli, Luigi Cerulo, Gerardo Canfora,...
BMCBI
2008
83views more  BMCBI 2008»
14 years 10 months ago
Models of deletion for visualizing bacterial variation: an application to tuberculosis spoligotypes
Background: Molecular typing methods are commonly used to study genetic relationships among bacterial isolates. Many of these methods have become standardized and produce portable...
Josephine F. Reyes, Andrew R. Francis, Mark M. Tan...
116
Voted
ECSQARU
2005
Springer
15 years 3 months ago
Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Carlos Iván Chesñevar, Guillermo Ric...
85
Voted
AAAI
2007
15 years 17 days ago
Unscented Message Passing for Arbitrary Continuous Variables in Bayesian Networks
Since Bayesian network (BN) was introduced in the field of artificial intelligence in 1980s, a number of inference algorithms have been developed for probabilistic reasoning. Ho...
Wei Sun, Kuo-Chu Chang
90
Voted
RECOMB
2010
Springer
14 years 8 months ago
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
Jean-Philippe Doyon, Celine Scornavacca, K. Yu. Go...