MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Complexity of Matching Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

32 documents found, showing 1 through 10. Next 10 →

ATOM

Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract)
by Miki Hermann, Phokion G. Kolaitis — 1995 — EDS), PROCEEDINGS 20TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PRAGUE (CZECH REPUBLIC). LECTURE NOTES IN COMPUTER SCIENCE
…Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract) Miki…
Cited by 6 (4 self) – Add To MetaCart

Isolation, Matching, and Counting: Uniform and Nonuniform Upper Bounds
by Eric Allender, Klaus Reinhardt, Shiyu Zhon — 1998 — Journal of Computer and System Sciences
… that the perfect matching problem is in the complexity class SPL (in the nonuniform setting). This provides a…
Cited by 14 (4 self) – Add To MetaCart

Eduardo Camponogara
by Sarosh Talukdar Department, Eduardo Camponogara, Sarosh N. Talukdar
… complexity of these matching problems and tests the merit in small but prototypical networks. (Networks…
Add To MetaCart

baseline matching with applications to visual servoing
by Dennis Tell — 2002 — PhD thesis, Computational Vision and Active Perception Laboratory (CVAP), Royal Institute of Technology
… almost the same position in both images, and the complexity of the matching problem is reduced…
Cited by 2 (0 self) – Add To MetaCart

H.: An error-tolerant approximate matching algorithm for attributed planar graphs and its
by Michel Neuhaus, Horst Bunke — 2004 — In: Proc. 10th Int. Workshop on Structural and Syntactic Pattern Recognition. LNCS 3138
… and their costs. Due to the enormous computational complexity of the matching problem for general graphs, a number…
Cited by 6 (4 self) – Add To MetaCart

Betting on permutations
by Yiling Chen, Evdokia Nikolova, Lance Fortnow — 2007 — In ACM Conference on Electronic Commerce
… the expressiveness of the bidding language and the computational complexity of the matching problem. We want to offer…
Cited by 10 (8 self) – Add To MetaCart

Feature Extraction from Aerial Images and Structural Stereo Matching
by Drago Torkar, Nikola Pavesic, Drago Torkar — 1996
… The outdoor/aerial scenes are far the most unstructured of scene domains and provide complex matching problems…
Add To MetaCart

Representation Changes for Efficient Learning in Structural Domains
by Jean-daniel Zucker, Jean-gabriel Ganascia — 1996 — In Proceedings of the Thirteenth International Conference on Machine Learning
… DESCRIPTION S TO ADDRESS THE MATCHING PROBLEM Our approach to cope with the complexity of the matching problem…
Cited by 3 (0 self) – Add To MetaCart

Betting Boolean-Style: A Framework for Trading in Securities Based on Logical Formulas
by Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman — 2003
…, the auctioneer faces a complex matching problem to decide which bids are accepted for how many units at what…
Cited by 12 (9 self) – Add To MetaCart

Schema and ontology matching with COMA++
by David Aumueller, Hong-Hai Do, Sabine Massmann, Erhard Rahm — 2005 — IN SIGMOD CONFERENCE
… STRATEGIES COMA++ supports higher-level strategies to address complex match problems, in particular fragment…
Cited by 27 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB