200 search results - page 17 / 40 » Projective mad families |
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
WCRE
2009
IEEE
15 years 4 months ago
2009
IEEE
The increasing amount of data available about software systems poses new challenges for re- and reverse engineering research, as the proposed approaches need to scale. In this con...
116
click to vote
WCRE
2008
IEEE
15 years 4 months ago
2008
IEEE
The increasing amount of data available about software systems poses new challenges for re- and reverse engineering research, as the proposed approaches need to scale. In this con...
GD
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
116
click to vote
HRI
2011
ACM
14 years 1 months ago
2011
ACM
This paper describes a methodology for performing longitudinal evaluations when a social robotic telepresence system is deployed in realistic environments. This work is the core o...