Sciweavers

372 search results - page 70 / 75
» Mining the space of graph properties
Sort
View
JMLR
2006
186views more  JMLR 2006»
13 years 7 months ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
TCS
2008
13 years 7 months ago
Distance- k knowledge in self-stabilizing algorithms
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
JAR
2000
90views more  JAR 2000»
13 years 7 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
ISVC
2010
Springer
13 years 5 months ago
Visual Network Analysis of Dynamic Metabolic Pathways
We extend our previous work on the exploration of static metabolic networks to evolving, and therefore dynamic, pathways. We apply our visualization software to data from a simulat...
Markus Rohrschneider, Alexander Ullrich, Andreas K...
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
13 years 5 months ago
Using Strategy Objectives for Network Security Analysis
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...
Elie Bursztein, John C. Mitchell