340 search results - page 19 / 68 » Clustering with Lower Bound on Similarity |
103
click to vote
DEXA
2009
Springer
15 years 4 months ago
2009
Springer
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
SISAP
2008
IEEE
15 years 3 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
ACL
2007
14 years 11 months ago
2007
We propose a new, simple model for the automatic induction of selectional preferences, using corpus-based semantic similarity metrics. Focusing on the task of semantic role labeli...
GC
2007
Springer
14 years 9 months ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...