99 search results - page 15 / 20 » Single-Pass List Partitioning |
110
click to vote
SIGIR
2002
ACM
14 years 11 months ago
2002
ACM
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...
215
click to vote
GECCO
2011
Springer
14 years 3 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
119
click to vote
DM
2000
14 years 11 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
DAC
2003
ACM
16 years 19 days ago
2003
ACM
While Boolean logic minimization is typically used in logic synthesis, logic minimization can be useful in numerous other applications. However, many of those applications, such a...
102
Voted
EDBT
2008
ACM
15 years 11 months ago
2008
ACM
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...