Sciweavers

1542 search results - page 196 / 309
» The metamathematics of random graphs
Sort
View
ICML
2005
IEEE
16 years 2 months ago
Predicting protein folds with structural repeats using a chain graph model
Protein fold recognition is a key step towards inferring the tertiary structures from amino-acid sequences. Complex folds such as those consisting of interacting structural repeat...
Yan Liu, Eric P. Xing, Jaime G. Carbonell
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 2 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ICNS
2009
IEEE
15 years 8 months ago
Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
Cédric Gaël Aboue-Nze, Fréd&eac...
COCOA
2009
Springer
15 years 8 months ago
Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
Nasser R. Sabar, Masri Ayob, Graham Kendall, Rong ...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 7 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner