Sciweavers

1525 search results - page 38 / 305
» Matching with Regular Constraints
Sort
View
134
Voted
BIS
2008
119views Business» more  BIS 2008»
15 years 4 months ago
Fuzzy Constraint-based Schema Matching Formulation
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
114
Voted
CVPR
2007
IEEE
16 years 5 months ago
Regularized Mixed Dimensionality and Density Learning in Computer Vision
A framework for the regularized estimation of nonuniform dimensionality and density in high dimensional data is introduced in this work. This leads to learning stratifications, th...
Gloria Haro, Gregory Randall, Guillermo Sapiro
JFP
2006
90views more  JFP 2006»
15 years 3 months ago
Regular expression filters for XML
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...
Haruo Hosaya
ACCV
2010
Springer
14 years 10 months ago
A Weak Structure Model for Regular Pattern Recognition Applied to Facade Images
Abstract. We propose a novel method for recognition of structured images and demonstrate it on detection of windows in facade images. Given an ability to obtain local low-level dat...
Radim Tylecek, Radim Sára
143
Voted
IANDC
2007
117views more  IANDC 2007»
15 years 3 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis