Sciweavers

1525 search results - page 37 / 305
» Matching with Regular Constraints
Sort
View
SIAMCO
2002
81views more  SIAMCO 2002»
15 years 3 months ago
Optimality Conditions for Irregular Inequality-Constrained Problems
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...
Alexey F. Izmailov, Mikhail V. Solodov
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
16 years 10 days ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong
ECCV
2002
Springer
16 years 5 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
EMMCVPR
2005
Springer
15 years 9 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
ICIP
2010
IEEE
15 years 1 months ago
High quality scanned book compression using pattern matching
This paper proposes a hybrid approximate pattern matching/ transform-based compression engine. The idea is to use regular video interframe prediction as a pattern matching algorit...
Alexandre Zaghetto, Ricardo L. de Queiroz