Sciweavers

10997 search results - page 157 / 2200
» On the Structure of Complete Sets
Sort
View
IPL
2008
129views more  IPL 2008»
15 years 6 months ago
Parameterized approximation of dominating set problems
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
Rodney G. Downey, Michael R. Fellows, Catherine Mc...
JAR
2006
81views more  JAR 2006»
15 years 6 months ago
Verifying the SET Purchase Protocols
SET (Secure Electronic Transaction) is a suite of protocols proposed by a consortium of credit card companies and software corporations to secure ecommerce transactions. The Purcha...
Giampaolo Bella, Fabio Massacci, Lawrence C. Pauls...
TCS
1998
15 years 6 months ago
Threshold Dominating Sets and an Improved Characterization of W[2]
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
Rodney G. Downey, Michael R. Fellows
AMAI
2004
Springer
15 years 12 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
CSB
2005
IEEE
126views Bioinformatics» more  CSB 2005»
16 years 6 days ago
Discover True Association Rates in Multi-protein Complex Proteomics Data Sets
Experimental processes to collect and process proteomics data are increasingly complex, while the computational methods to assess the quality and significance of these data remain...
Changyu Shen, Lang Li, Jake Yue Chen