1952 search results - page 236 / 391 » Complete partitions of graphs |
177
click to vote
PAMI
2010
15 years 5 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
192
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
188
click to vote
CSL
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
190
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
183
click to vote
GECCO
2007
Springer
16 years 21 days ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...