556 search results - page 63 / 112 » Pair Programming: Not for Everyone |
FOAL
2008
ACM
13 years 10 months ago
2008
ACM
Often, insertion of several aspects into one system is desired and in that case the problem of interference among the different aspects might arise, even if each aspect individual...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
DAC
2005
ACM
14 years 10 months ago
2005
ACM
We describe IODINE, a tool to automatically extract likely design properties using dynamic analysis. A practical bottleneck in the formal verification of hardware designs is the n...
CP
2009
Springer
14 years 9 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...