Sciweavers

1830 search results - page 12 / 366
» Workshop on Graph Computation Models
Sort
View
FUIN
2000
68views more  FUIN 2000»
13 years 7 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
CPM
2004
Springer
156views Combinatorics» more  CPM 2004»
14 years 1 months ago
A Computational Model for RNA Multiple Structural Alignment.
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
Eugene Davydov, Serafim Batzoglou
WG
2009
Springer
14 years 2 months ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle
NIPS
2003
13 years 9 months ago
Denoising and Untangling Graphs Using Degree Priors
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
Quaid Morris, Brendan J. Frey
CANDC
2009
ACM
14 years 2 months ago
Understanding the creative conversation: modeling to engagement
This workshop is aimed at describing the elusive creative process: addressing models and of creative practice, from art to craft, from dance to education. In particular, we wish t...
David A. Shamma, Dan Perkel, Kurt Luther