1688 search results - page 271 / 338 » The Complexity of Rationalizing Matchings |
IPPS
2002
IEEE
14 years 3 months ago
2002
IEEE
The convergence of TV and new features such as Internet and games, requires a generic media-processing platform, that enables simultaneous execution of very diverse tasks, ranging...
ISCAS
2002
IEEE
14 years 3 months ago
2002
IEEE
As the complexity of embedded systems grows rapidly, it is common to accelerate critical tasks with hardware. Designers usually use off-the-shelf components or licensed IP cores t...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...
COCOON
2001
Springer
14 years 2 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
DBPL
2001
Springer
14 years 2 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...