3105 search results - page 564 / 621 » The Path-Packing Structure of Graphs |
LICS
1997
IEEE
15 years 4 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
96
Voted
SC
1995
ACM
15 years 4 months ago
1995
ACM
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
119
click to vote
DCOSS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
104
Voted
AAAI
2007
15 years 2 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
AAAI
2007
15 years 2 months ago
2007
A natural representation of data is given by the parameters which generated the data. If the space of parameters is continuous, then we can regard it as a manifold. In practice, w...