328 search results - page 53 / 66 » Algorithms for the edge-width of an embedded graph |
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— We continue our investigation into the application of pervasive, embedded networks to support multi-robot tasks. In this work we use a new a hardware platform, the GNATs, to ai...
101
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
CODES
2006
IEEE
14 years 11 months ago
2006
IEEE
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...