Sciweavers

592 search results - page 53 / 119
» Crossing numbers of random graphs
Sort
View
FCS
2009
13 years 5 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
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
SASN
2004
ACM
14 years 1 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
CIKM
2007
Springer
14 years 2 months ago
Extending query translation to cross-language query expansion with markov chain models
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...
Guihong Cao, Jianfeng Gao, Jian-Yun Nie, Jing Bai
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 8 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
Prasad Chebolu, Mary Cryan, Russell A. Martin