Sciweavers

325 search results - page 34 / 65
» Hamilton cycles in random graphs and directed graphs
Sort
View
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
14 years 2 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 8 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 7 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
ECCV
2010
Springer
14 years 2 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
HICSS
2003
IEEE
167views Biometrics» more  HICSS 2003»
14 years 1 months ago
Discovering Group Interaction Patterns in a Teachers Professional Community
Managers and group leaders of a community may not have enough information to help them direct the community development. In this paper, we adopt social network analysis, graph the...
Fu-ren Lin, Chun-Hung Chen, Kuo-Lung Tsai