Sciweavers

3008 search results - page 259 / 602
» Independence in connected graphs
Sort
View
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
16 years 21 days ago
A Practical Algorithm for Network Topology Inference
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
Dimitri Marinakis, Gregory Dudek
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
15 years 8 months ago
On stars and Steiner stars
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....
Adrian Dumitrescu, Csaba D. Tóth
DICTA
2003
15 years 8 months ago
Automatic Adaptive Segmentation of Moving Objects Based on Spatio-Temporal Information
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
Ofer Miller, Amir Averbuch, Yosi Keller
FCS
2009
15 years 4 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
JGT
2010
158views more  JGT 2010»
15 years 5 months ago
Cubicity of interval graphs and the claw number
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
Abhijin Adiga, L. Sunil Chandran