Sciweavers

5140 search results - page 153 / 1028
» Complex Network of Earthquakes
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 6 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
MOBIHOC
2004
ACM
16 years 4 months ago
Error characteristics of ad hoc positioning systems (aps)
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
Dragos Niculescu, Badri Nath
CPM
2009
Springer
137views Combinatorics» more  CPM 2009»
15 years 11 months ago
The Structure of Level-k Phylogenetic Networks
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
Philippe Gambette, Vincent Berry, Christophe Paul
ISCAS
2007
IEEE
128views Hardware» more  ISCAS 2007»
15 years 10 months ago
Synchronization of the Time-Varying Discrete Biological Networks
Abstract— The study of synchronization of population dynamics is extremely important for predicting and evaluating the risk of global extinctions. The migration in a network of p...
Liang Chen, Jinhu Lu, Junan Lu
INTERSENSE
2006
ACM
15 years 10 months ago
Particle-based methodology for representing mobile ad-hoc networks
—We present a methodology based on physics laws and particles in order to represent, simulate, and architect advanced networking models. We introduce a mathematical formalism wit...
Carlos J. Martinez, Marisa López, Luis C. E...