38 search results - page 7 / 8 » Multiple Kronecker covering graphs |
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
ICSM
2006
IEEE
13 years 11 months ago
2006
IEEE
Facts extracted from source code have been used to support a variety of software engineering activities, ranging from architectural understanding, through detection of design patt...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
INFOCOM
1998
IEEE
13 years 9 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
IACR
2011
12 years 4 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...