11345 search results - page 1903 / 2269 » Foundations of Computer Science |
137
click to vote
ACMACE
2009
ACM
15 years 8 months ago
2009
ACM
In this paper, we describe the design and development of a social game called Familiars. Inspired by the daemons in Pullman’s “Dark Material” trilogy, Familiars are animal c...
152
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
Computational technologies have been increasingly explored to make biomedical knowledge and data more accessible for human understanding, comparison, analysis and communication. I...
161
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
153
click to vote
GD
2001
Springer
15 years 8 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
122
click to vote
IWVF
2001
Springer
15 years 8 months ago
2001
Springer
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...