280 search results - page 30 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
115
click to vote
IPSN
2011
Springer
14 years 3 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
146
click to vote
SOICT
2010
14 years 6 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
102
click to vote
RECOMB
2005
Springer
16 years 2 days ago
2005
Springer
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
109
click to vote
ICB
2007
Springer
15 years 3 months ago
2007
Springer
We present a feature-based 3D face recognition algorithm and propose a keypoint identification technique which is repeatable and identifies keypoints where shape variation is high ...
105
click to vote
PDP
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...