1977 search results - page 190 / 396 » The satisfactory partition problem |
170
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
174
click to vote
ISPASS
2009
IEEE
2009
IEEE
Machine learning based online performance prediction for runtime parallelization and task scheduling
16 years 1 months ago
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
188
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
185
click to vote
FOCS
2007
IEEE
16 years 28 days ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
185
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...