Sciweavers

6274 search results - page 993 / 1255
» From query complexity to computational complexity
Sort
View
DSN
2002
IEEE
16 years 4 days ago
Model Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
Boudewijn R. Haverkort, Lucia Cloth, Holger Herman...
CGF
2011
14 years 10 months ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
ALGORITHMICA
2011
15 years 2 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
RECOMB
2008
Springer
16 years 7 months ago
Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer
Abstract. One phylogeny-based approach to horizontal gene transfer (HGT) detection entails comparing the topology of a gene tree to that of the species tree, and using their differ...
Cuong Than, Guohua Jin, Luay Nakhleh
BMCBI
2010
159views more  BMCBI 2010»
15 years 7 months ago
Predicting domain-domain interaction based on domain profiles with feature selection and support vector machines
Background: Protein-protein interaction (PPI) plays essential roles in cellular functions. The cost, time and other limitations associated with the current experimental methods ha...
Alvaro J. González, Li Liao