1994 search results - page 228 / 399 » Computation of Optical Flow Using Dynamic Programming |
CP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data. Constraint programming has addre...
100
click to vote
ML
2002
ACM
14 years 9 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
128
click to vote
IJCNN
2006
IEEE
15 years 4 months ago
2006
IEEE
—This paper presents an Improved Snake Model (ISM) effective for performing fast image segmentation. The work takes advantage of two well-known snake models of Balloon [1] and GG...
ICPP
1994
IEEE
15 years 2 months ago
1994
IEEE
Shared memory in a parallel computer provides prowith the valuable abstraction of a shared address space--through which any part of a computation can access any datum. Although un...
101
click to vote
HPDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Large scale bioinformatics experiments are usually composed by a set of data flows generated by a chain of activities (programs or services) that may be modeled as scientific work...