Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Keyword
-
- Approximation algorithm (1)
- Bioinformatics (1)
- Biomolecular sequence analysis (1)
- Cache misses (1)
- Cluster analysis (statistics) (1)
-
- Competitive algorithms (1)
- Computer theory (1)
- Data compression (1)
- Dissolve Detector (1)
- Epistasis (Genetics) (1)
- Facility location (1)
- Genetic algorithms -- Evaluation (1)
- Image processing (1)
- Indexing (1)
- K mean (1)
- K median (1)
- Lecture videos (1)
- Linear time (1)
- Location theory (1)
- Maximum consecutive subsequence sum (1)
- Maximum-density segments (1)
- Objective function (1)
- Occam (Computer program language) (1)
- Online algorithm (1)
- Paging (1)
- Quadtrees (1)
- Storage management (1)
- Support Vector Machine (1)
- Swapping (1)
- Synchronization (1)
Articles 1 - 8 of 8
Full-Text Articles in Theory and Algorithms
Synchronization Of Lecture Videos And Electronic Slides By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Synchronization Of Lecture Videos And Electronic Slides By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Research Collection School Of Computing and Information Systems
An essential goal of structuring lecture videos captured in live presentation is to provide a synchronized view of video clips and electronic slides. This paper presents an automatic approach to match video clips and slides based on the analysis of text embedded in lecture videos. We describe a method to reconstruct high-resolution video texts from multiple keyframes for robust OCRrecognition. A two-stage matching algorithm based on the title and content similarity measures between video clips and slides is also proposed.
A Robust Dissolve Detector By Support Vector Machine, Chong-Wah Ngo
A Robust Dissolve Detector By Support Vector Machine, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel approach for the robust detection and classification of dissolve sequences in videos. Our approach is based on the multi-resolution representation of temporal slices extracted from 3D image volume. At the low-resolution (LR) scale, the problem of dissolve detection is reduced as cut transition detection. At the highresolution (HR) space, Gabor wavelet features are computed for regions that surround the cuts located at LR scale. The computed features are then input to support vector machines for pattern classification. Encouraging results have been obtained through experiments.
Fast And Space-Efficient Location Of Heavy Or Dense Segments In Run-Length Encoded Sequences, Ronald I. Greenberg
Fast And Space-Efficient Location Of Heavy Or Dense Segments In Run-Length Encoded Sequences, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This paper considers several variations of an optimization problem with potential applications in such areas as biomolecular sequence analysis and image processing. Given a sequence of items, each with a weight and a length, the goal is to find a subsequence of consecutive items of optimal value, where value is either total weight or total weight divided by total length. There may also be a specified lower and/or upper bound on the acceptable length of subsequences. This paper shows that all the variations of the problem are solvable in linear time and space even with non-uniform item lengths and divisible …
The Online Median Problem, Ramgopal R. Mettu, C. Greg Plaxton
The Online Median Problem, Ramgopal R. Mettu, C. Greg Plaxton
Dartmouth Scholarship
We introduce a natural variant of the (metric uncapacitated) k-median problem that we call the online median problem. Whereas the k-median problem involves optimizing the simultaneous placement of k facilities, the online median problem imposes the following additional constraints: the facilities are placed one at a time, a facility cannot be moved once it is placed, and the total number of facilities to be placed, k, is not known in advance. The objective of an online median algorithm is to minimize the competitive ratio, that is, the worst-case ratio of the cost of an online placement to …
Qr Factorization With Morton-Ordered Quadtree Matrices For Memory Re-Use And Parallelism, Jeremy D. Frens, David S. Wise
Qr Factorization With Morton-Ordered Quadtree Matrices For Memory Re-Use And Parallelism, Jeremy D. Frens, David S. Wise
University Faculty Publications and Creative Works
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this blocking results in code that honors the memory hierarchy without the need for transforming the code. Furthermore, the divide-and-conquer algorithm breaks problems down into independent computations. These independent computations can be dispatched in parallel for straight-forward parallel processing. Proof-of-concept is given by an algorithm for QR factorization based on Givens rotations for quadtree matrices in Morton-order storage. The algorithms deliver positive results, competing with and even beating the LAPACK equivalent.
Personalizing Interactions With Information Systems, Saverio Perugini, Naren Ramakrishnan
Personalizing Interactions With Information Systems, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
Personalization constitutes the mechanisms and technologies necessary to customize information access to the end-user. It can be defined as the automatic adjustment of information content, structure, and presentation tailored to the individual. In this chapter, we study personalization from the viewpoint of personalizing interaction. The survey covers mechanisms for information-finding on the web, advanced information retrieval systems, dialog-based applications, and mobile access paradigms. Specific emphasis is placed on studying how users interact with an information system and how the system can encourage and foster interaction. This helps bring out the role of the personalization system as a facilitator which reconciles …
The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones
The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones
Computer Science Faculty Publications
Mixed-initiative interaction is an important facet of many conversational interfaces, flexible planning architectures, intelligent tutoring systems, and interactive information retrieval systems. Software systems for mixed-initiative interaction must enable us to both operationalize the mixing of initiative (i.e., support the creation of practical dialogs) and to reason in real-time about how a flexible mode of interaction can be supported (e.g., from a meta-dialog standpoint). In this paper, we present the staging transformation approach to mixing initiative, where a dialog script captures the structure of the dialog and dialog control processes are realized through generous use of program transformation techniques (e.g., partial …
Ordering Genetic Algorithm Genomes With Reconstructability Analysis, Stephen Shervais, Martin Zwick
Ordering Genetic Algorithm Genomes With Reconstructability Analysis, Stephen Shervais, Martin Zwick
Systems Science Faculty Publications and Presentations
The building block hypothesis implies that genetic algorithm effectiveness is influenced by the relative location of epistatic genes on the chromosome. We find that this influence exists, but depends on the generation in which it is measured. Early in the search process it may be more effective to have epistatic genes widely separated. Late in the search process, effectiveness is improved when they are close together. The early search effect is weak but still statistically significant; the late search effect is much stronger and plainly visible. We demonstrate both effects with a set of simple problems, and show that infonnation-theoretic …