Sciweavers

1188 search results - page 124 / 238
» Extended Graph Unification
Sort
View
FSEN
2009
Springer
15 years 4 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
LREC
2008
175views Education» more  LREC 2008»
14 years 11 months ago
Arabic WordNet: Semi-automatic Extensions using Bayesian Inference
This presentation focuses on the semi-automatic extension of Arabic WordNet (AWN) using lexical and morphological rules and applying Bayesian inference. We briefly report on the c...
Horacio Rodríguez, David Farwell, Javi Ferr...
IEEECIT
2009
IEEE
14 years 7 months ago
Hamiltonian Connectedness of Recursive Dual-Net
Recursive Dual-Net (RDN) was proposed recently as an effective, high-performance interconnection network for supercomputers with millions of nodes. A Recursive DualNet RDN(B) is r...
Yamin Li, Shietung Peng, Wanming Chu
MST
2010
86views more  MST 2010»
14 years 4 months ago
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
Peter Damaschke
ICML
2004
IEEE
15 years 10 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...