Sciweavers

558 search results - page 83 / 112
» Trees and Matchings
Sort
View
IPL
2002
118views more  IPL 2002»
15 years 1 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
153
Voted
ICIP
2005
IEEE
16 years 3 months ago
Coarse-level object recognition using interlevel products of complex wavelets
This paper introduces the Interlevel Product (ILP) which is a transform based upon the Dual-Tree Complex Wavelet. Coefficients of the ILP have complex values whose magnitudes indi...
Ryan Anderson, Nick G. Kingsbury, Julien Fauqueur
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 1 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
ADC
2008
Springer
141views Database» more  ADC 2008»
15 years 8 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
CIKM
2005
Springer
15 years 7 months ago
ViPER: augmenting automatic information extraction with visual perceptions
In this paper we address the problem of unsupervised Web data extraction. We show that unsupervised Web data extraction becomes feasible when supposing pages that are made up of r...
Kai Simon, Georg Lausen