151 search results - page 1 / 31 » Cleaning a network with brushes |
TCS
2008
13 years 4 months ago
2008
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
DAM
2010
13 years 4 months ago
2010
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...
CHI
2008
ACM
14 years 5 months ago
2008
ACM
This case study in UbiComp technology and design presents a "Playful Toothbrush" system for assisting parents and teachers to motivate kindergarten children to learn pro...
CAAN
2007
Springer
13 years 10 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
AVI
2006
13 years 6 months ago
2006
During grouping tasks for data exploration and sense-making, the criteria are normally not well-defined. When users are bringing together data objects thought to be similar in som...