Sciweavers

1653 search results - page 330 / 331
» Directed tree-width examples
Sort
View
ALGORITHMICA
2011
13 years 1 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
BMCBI
2011
13 years 1 months ago
MRCQuant- an accurate LC/MS relative isotopic quantification algorithm on TOF instruments
Background: Relative isotope abundance quantification, which can be used for peptide identification and differential peptide quantification, plays an important role in liquid chro...
William H. Haskins, Konstantinos Petritis, Jianqiu...
BMCBI
2011
13 years 1 months ago
A comparison and user-based evaluation of models of textual information structure in the context of cancer risk assessment
Background: Many practical tasks in biomedicine require accessing specific types of information in scientific literature; e.g. information about the results or conclusions of the ...
Yufan Guo, Anna Korhonen, Maria Liakata, Ilona Sil...
WWW
2009
ACM
14 years 7 months ago
Collaborative filtering for orkut communities: discovery of user latent behavior
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...
WenYen Chen, Jon-Chyuan Chu, Junyi Luan, Hongjie B...
QEST
2005
IEEE
13 years 12 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha