227 search results - page 8 / 46 » Complexity Results for Compressing Optimal Paths |
WG
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
ACSAC
2003
IEEE
15 years 4 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
107
click to vote
MM
2004
ACM
15 years 4 months ago
2004
ACM
An optimized scheme of multiplexing coded mesh and texture data to facilitate progressive transmission of 3D textured models is proposed in this work. The mesh and texture data of...
ICIP
2003
IEEE
16 years 21 days ago
2003
IEEE
Block coders are among the most common compression tools available for still images and video sequences. Their low computational complexity along with their good performance make ...
102
click to vote
SECON
2008
IEEE
15 years 5 months ago
2008
IEEE
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...