340 search results - page 44 / 68 » Clustering with Lower Bound on Similarity |
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
IJCAI
2007
14 years 11 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
TALG
2010
14 years 4 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
163
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
MONET
2008
14 years 9 months ago
2008
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...