2600 search results - page 11 / 520 » Clustering with or without the Approximation |
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. For a book, the title and abstract provide a good first impression of what to expect from it. For a database, getting a first impression is not so straightforward. Whil...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
SIGECOM
2010
ACM
14 years 14 days ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
IPL
2008
13 years 7 months ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...