Sciweavers

1525 search results - page 57 / 305
» Matching with Regular Constraints
Sort
View
DKE
2007
199views more  DKE 2007»
15 years 6 months ago
QMatch - Using paths to match XML schemas
Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing ...
Naiyana Tansalarak, Kajal T. Claypool
CP
2009
Springer
16 years 6 months ago
Restricted Global Grammar Constraints
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen...
George Katsirelos, Sebastian Maneth, Nina Narodyts...
ICPR
2010
IEEE
16 years 1 months ago
Robust Matching in an Uncertain World
Finding point correspondences which are consistent with a geometric constraint is one of the cornerstones of many computer vision problems. This is a difficult task because of sp...
Frédéric Sur
ASAP
1997
IEEE
139views Hardware» more  ASAP 1997»
15 years 10 months ago
Buffer size optimization for full-search block matching algorithms
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
Yuan-Hau Yeh, Chen-Yi Lee
FOIKS
2010
Springer
16 years 1 months ago
Evolving Schemas for Streaming XML
A. Falappa, an Abstract Dialogue Framework Guillermo R. Simari Regular Helena Kein¨anen An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games 15:30-16:00 A...
Maryam Shoaran, Alex Thomo