556 search results - page 31 / 112 » Pair Programming: Not for Everyone |
ICIAR
2004
Springer
14 years 2 months ago
2004
Springer
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....
ICSE
2001
IEEE-ACM
14 years 1 months ago
2001
IEEE-ACM
Extreme Programming (XP) is a new and controversial sojiware processfor small teams. A practical training courseat the universityof Karlsruheled to thefollowing observations about...
MMSP
2008
IEEE
14 years 3 months ago
2008
IEEE
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
ACL
2008
13 years 10 months ago
2008
The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present ...
MVA
1996
13 years 10 months ago
1996
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...