Sciweavers

589 search results - page 88 / 118
» Matching Concavity Trees
Sort
View
IPL
2002
118views more  IPL 2002»
13 years 8 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...
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 5 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
COLING
2010
13 years 3 months ago
Syntax Based Reordering with Automatically Derived Rules for Improved Statistical Machine Translation
Syntax based reordering has been shown to be an effective way of handling word order differences between source and target languages in Statistical Machine Translation (SMT) syste...
Karthik Visweswariah, Jiri Navratil, Jeffrey S. So...
ICIP
2005
IEEE
14 years 10 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»
14 years 8 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...