Sciweavers

5105 search results - page 27 / 1021
» Approximate Structural Consistency
Sort
View
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
14 years 2 months ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
ECAI
2008
Springer
13 years 10 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
MICS
2007
128views more  MICS 2007»
13 years 8 months ago
Structured Low Rank Approximation of a Bezout Matrix
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
Dongxia Sun, Lihong Zhi
COMPGEOM
2010
ACM
14 years 1 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
CC
2002
Springer
126views System Software» more  CC 2002»
13 years 8 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof