Sciweavers

Share
MVA
2002
119views Computer Vision» more  MVA 2002»
9 years 7 months ago
A Cooperative Method of SFM and Stereo for Motion and Depth Extraction
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...
Jae-Hean Kim, Myung Jin Chung
ENTCS
2007
94views more  ENTCS 2007»
9 years 7 months ago
Matching of Bigraphs
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...
Lars Birkedal, Troels Christoffer Damgaard, Arne J...
JDS
2006
44views more  JDS 2006»
9 years 7 months ago
Multiagent Matching Algorithms with and without Coach
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, ...
Frieder Stolzenburg, Jan Murray, Karsten Sturm
APPML
2008
77views more  APPML 2008»
9 years 8 months ago
A controllability approach to shape identification
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 ...
Robert Azencott, Roland Glowinski, A. M. Ramos
DAGSTUHL
2006
9 years 9 months ago
Many-to-Many Feature Matching in Object Recognition
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...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
10 years 2 days ago
Isolation, Matching, and Counting
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...
Eric Allender, Klaus Reinhardt
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
10 years 2 days ago
Decision Oracles are Equivalent to Matching Oracles
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...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
ICPR
2010
IEEE
10 years 17 days ago
Finding Multiple Object Instances with Occlusion
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...
Ge Guo, Tingting Jiang, Yizhou Wang, Wen Gao
SIGECOM
2003
ACM
115views ECommerce» more  SIGECOM 2003»
10 years 1 months ago
Betting boolean-style: a framework for trading in securities based on logical formulas
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...
Lance Fortnow, Joe Kilian, David M. Pennock, Micha...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
10 years 1 months ago
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems
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...
Jérôme Monnot
books