227 search results - page 5 / 46 » Complexity Results for Compressing Optimal Paths |
78
Voted
ISCAS
2003
IEEE
15 years 4 months ago
2003
IEEE
In this paper we present two performance optimization methods for a motion compensated (MC) 2D wavelet video coding technique, which is based on two of the current stateof-the-art...
INFOCOM
1995
IEEE
15 years 2 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
112
click to vote
DBPL
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
101
click to vote
TIP
1998
14 years 10 months ago
1998
Abstract—In this paper, we propose an optimal quadtree (QT)based motion estimator for video compression. It is optimal in the sense that for a given bit budget for encoding the d...
109
click to vote
ICIP
2007
IEEE
15 years 5 months ago
2007
IEEE
Palette re-ordering is a well known and very effective approach for improving the compression of color indexed images. If the spatial distribution of the indexes in the image is s...