9842 search results - page 1748 / 1969 » The Complexity of the Matching-Cut Problem |
153
click to vote
PAKDD
2009
ACM
16 years 1 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
127
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
146
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Automotive companies are forced to continuously extend and improve their product line-up. However, increasing diversity, higher design complexity, and shorter development cycles c...
138
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
148
Voted
ICWS
2009
IEEE
16 years 1 months ago
2009
IEEE
Professional mashups that include complex choreographies, data mediation, and result publishing within Web pages are still affected by implementation and design practices that rel...