Sciweavers

849 search results - page 55 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
ICDT
2003
ACM
91views Database» more  ICDT 2003»
14 years 1 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
ICIP
2005
IEEE
14 years 9 months ago
Fast distortion-buffer optimized streaming of multimedia
This paper presents a distortion optimized streaming algorithm for on-demand streaming of multimedia. Given the pre-encoded packets of a multimedia stream, we propose a fast algor...
Anshul Sehgal, Ashish Jagmohan, Olivier Verscheure...
DAC
2005
ACM
14 years 8 months ago
A new canonical form for fast boolean matching in logic synthesis and verification
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram
DCC
2004
IEEE
14 years 7 months ago
Efficient Bit Allocation for Dependent Video Coding
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Yegnaswamy Sermadevi, Sheila S. Hemami
ECCV
2008
Springer
14 years 9 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...