MVA
2002
14 years 7 days ago
2002
Stereo is a useful technique for obtaining depth information from images. However, it is required that the baseline length between two cameras should be large to increase depth pr...
ENTCS
2007
14 years 17 days ago
2007
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
JDS
2006
14 years 17 days ago
2006
The concept of "agent" has been used to describe many different artefacts: software programs, mobile robots, or even human beings. In a system consisting of many agents, ...
APPML
2008
14 years 22 days ago
2008
The main goal of this article is to discuss a controllability approach to the image matching / shape identification problem, an important issue in many applications, medical ones ...
DAGSTUHL
2006
14 years 2 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
COCO
1998
Springer
14 years 4 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
PKC
1999
Springer
14 years 4 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
ICPR
2010
IEEE
14 years 5 months ago
2010
IEEE
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges...
SIGECOM
2003
ACM
14 years 5 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
ISAAC
2005
Springer
14 years 6 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...