1404 search results - page 49 / 281 » Optimization problems in multiple-interval graphs |
132
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
101
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
111
click to vote
SIGECOM
2008
ACM
15 years 1 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
126
Voted
ICDM
2008
IEEE
15 years 8 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
110
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...