1172 search results - page 181 / 235 » Path Algorithms on Regular Graphs |
104
click to vote
CORR
2010
Springer
15 years 15 days ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
110
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
245
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
117
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
143
click to vote
SECON
2010
IEEE
14 years 11 months ago
2010
IEEE
Existing solutions to carrier-based sensor placement by a single robot, in a bounded unknown region of interest (ROI), do not guarantee full area coverage and/or do not terminate. ...