Sciweavers

328 search results - page 46 / 66
» Homomorphism bounded classes of graphs
Sort
View
SIAMCO
2010
127views more  SIAMCO 2010»
13 years 2 months ago
Tracking with Prescribed Transient Performance for Hysteretic Systems
Tracking of reference signals (assumed bounded with essentially bounded derivative) is considered for a class of single-input, single-output, nonlinear systems, described by a func...
Achim Ilchmann, Hartmut Logemann, Eugene P. Ryan
SPAA
2010
ACM
14 years 7 days ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
14 years 1 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
FSTTCS
2010
Springer
13 years 5 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
CIS
2010
Springer
13 years 2 months ago
Sensor Graphs for Guaranteed Cooperative Localization Performance
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
Y. Yuan, H. G. Tanner