Sciweavers

4894 search results - page 873 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
CSDA
2008
108views more  CSDA 2008»
13 years 8 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
CVIU
2008
180views more  CVIU 2008»
13 years 8 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
DSS
2008
109views more  DSS 2008»
13 years 8 months ago
Cross-lingual audio-to-text alignment for multimedia content management
This paper addresses a content management problem in situations where we have a collection of spoken documents in audio stream format in one language and a collection of related t...
Dau-Cheng Lyu, Ren-Yuan Lyu, Yuang-Chin Chiang, Ch...
CG
2006
Springer
13 years 8 months ago
Interactive mesh deformation using equality-constrained least squares
Mesh deformation techniques that preserve the differential properties have been intensively studied. In this paper, we propose an equality-constrained least squares approach for s...
H. Masuda, Y. Yoshioka, Y. Furukawa
CORR
2006
Springer
74views Education» more  CORR 2006»
13 years 7 months ago
Scheduling Algorithms for Procrastinators
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
Michael A. Bender, Raphaël Clifford, Kostas T...