Sciweavers

419 search results - page 12 / 84
» Improving Adaptable Similarity Query Processing by Using App...
Sort
View
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 10 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
FUIN
2006
139views more  FUIN 2006»
13 years 8 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
GI
2010
Springer
13 years 7 months ago
Toward an adaptive String Similarity Measure for Matching Product Offers
: Product matching aims at identifying different product offers referring to the same real-world product. Product offers are provided by different merchants and describe products u...
Andreas Thor
ITCC
2003
IEEE
14 years 1 months ago
A Method for Calculating Term Similarity on Large Document Collections
We present an efficient algorithm called the Quadtree Heuristic for identifying a list of similar terms for each unique term in a large document collection. Term similarity is de...
Wolfgang W. Bein, Jeffrey S. Coombs, Kazem Taghva
BIOCOMP
2009
13 years 9 months ago
Improving Remote Homology Detection Using Sequence Properties and Position Specific Scoring Matrices
Current biological sequence comparison tools frequently fail to recognize matches between homologs when sequence similarity is below the twilight zone of less than 25% sequence id...
Gina Cooper, Michael L. Raymer