Sciweavers

523 search results - page 76 / 105
» Decidability of string graphs
Sort
View
FUIN
2008
98views more  FUIN 2008»
15 years 3 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
TVCG
2008
95views more  TVCG 2008»
15 years 3 months ago
Improving the Readability of Clustered Social Networks using Node Duplication
Exploring communities is an important task in social network analysis. Such communities are currently identified using clustering methods to group actors. This approach often leads...
Nathalie Henry, Anastasia Bezerianos, Jean-Daniel ...
146
Voted
SIAMDM
2010
140views more  SIAMDM 2010»
15 years 1 months ago
Retractions to Pseudoforests
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
Tomás Feder, Pavol Hell, Peter Jonsson, And...
LICS
2005
IEEE
15 years 9 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
NIPS
2008
15 years 4 months ago
Predicting the Geometry of Metal Binding Sites from Protein Sequence
Metal binding is important for the structural and functional characterization of proteins. Previous prediction efforts have only focused on bonding state, i.e. deciding which prot...
Paolo Frasconi, Andrea Passerini