23 search results - page 5 / 5 » A New Family of k-in-a-Row Games |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
ANSOFT
1998
13 years 7 months ago
1998
Programmes in “Software Engineering” have become a source of contention in many universities. Computer Science departments, many of which have used that phrase to describe ind...