Sciweavers

1810 search results - page 249 / 362
» Similarity estimation techniques from rounding algorithms
Sort
View
134
Voted
SOCA
2007
IEEE
15 years 10 months ago
Structure Matching for Enhancing UDDI Queries Results
To enhance UDDI query capability, typically based on taxonomic classification, semantic matching is assuming a key role. Even if we recognize the great importance of semantics in ...
Giancarlo Tretola, Eugenio Zimeo
CINQ
2004
Springer
163views Database» more  CINQ 2004»
15 years 9 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
128
Voted
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
15 years 4 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
148
Voted
JACM
2010
116views more  JACM 2010»
15 years 2 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
140
Voted
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 7 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey