6274 search results - page 611 / 1255 » From query complexity to computational complexity |
205
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
144
click to vote
ACL
2010
15 years 5 months ago
2010
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically inducing cogn...
187
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
212
click to vote
WISE
2005
Springer
16 years 23 days ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
230
click to vote
JCDL
2010
ACM
16 years 8 days ago
2010
ACM
In recent years, the vast amount of digitally available content has lead to the creation of many topic-centered digital libraries. Also in the domain of chemistry more and more di...