Sciweavers

433 search results - page 27 / 87
» Optimal Segmentation of Random Sequences
Sort
View
CCCG
2007
15 years 1 months ago
On a Geometric Approach to the Segment Sum Problem and Its Generalization
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
Asish Mukhopadhyay, Eugene Greene
PE
2006
Springer
115views Optimization» more  PE 2006»
14 years 11 months ago
Optimal processor allocation to differentiated job flows
In this paper, we study the problem of dynamic allocation of the resources of a general parallel processing system, comprised of M heterogeneous processors and M heterogeneous tra...
Kimberly M. Wasserman, George Michailidis, Nichola...

Book
5396views
16 years 10 months ago
Markov Random Field Modeling in Computer Vision
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Stan Z. Li
83
Voted
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Fast camera calibration for the analysis of sport sequences
Semantic analysis of sport sequences requires camera calibration to obtain player and ball positions in real-world coordinates. For court sports like tennis, the marker lines on t...
Dirk Farin, Jungong Han, Peter H. N. de With
ICPR
2000
IEEE
16 years 23 days ago
Application of Planar Motion Segmentation for Scene Text Extraction
This paper explores an approach for extracting scene text from a sequence of images with relative motion between the camera and the scene. It is assumed that the scene text lies o...
Tarak Gandhi, Rangachar Kasturi, Sameer Antani