Sciweavers

3192 search results - page 266 / 639
» The minimum latency problem
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 6 months ago
Approximating Transitivity in Directed Networks
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
179
Voted
IJFCS
2006
70views more  IJFCS 2006»
15 years 6 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
164
Voted
JMIV
2006
161views more  JMIV 2006»
15 years 6 months ago
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Jérôme Darbon, Marc Sigelle
131
Voted
JMMA
2002
71views more  JMMA 2002»
15 years 6 months ago
Optimal Hierarchies for Quadrilateral Surfaces
Abstract. Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two r...
Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu
GIS
2010
ACM
15 years 4 months ago
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...
Maike Buchin, Anne Driemel, Marc J. van Kreveld, V...