21 search results - page 3 / 5 » Improving the CS1 experience with pair programming |
PLDI
2004
ACM
13 years 10 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
COMPSAC
2002
IEEE
13 years 10 months ago
2002
IEEE
Agile practices are arguably improving the productivity of small, co-located software development teams. In this paper, we describe an approach that tries to overcome the constrai...
GCB
1997
Springer
13 years 9 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
ICCV
2009
IEEE
14 years 10 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...
BMCBI
2006
13 years 5 months ago
2006
Background: The design of oligonucleotides and PCR primers for studying large genomes is complicated by the redundancy of sequences. The eukaryotic genomes are particularly diffic...