Sciweavers

62 search results - page 8 / 13
» Closed k-stop distance in graphs
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 8 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
JSYML
2010
120views more  JSYML 2010»
13 years 2 months ago
First order properties on nowhere dense structures
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
Jaroslav Nesetril, Patrice Ossona de Mendez
TCBB
2008
117views more  TCBB 2008»
13 years 7 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
ROBOCOMM
2007
IEEE
14 years 2 months ago
Decentralized swarm aggregation with static communication links
— The objective of this paper is decentralized swarm aggregation with collision avoidance. Specifically, each agent is assigned with a control law which is the sum of two elemen...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
ICNP
2003
IEEE
14 years 1 months ago
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionalit...
Bong-Jun Ko, Dan Rubenstein