425 search results - page 19 / 85 » Polynomial Time Data Reduction for Dominating Set |
IMAGING
2004
14 years 10 months ago
2004
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...
81
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
114
click to vote
EUSFLAT
2009
14 years 7 months ago
2009
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
102
click to vote
CAINE
2009
14 years 7 months ago
2009
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...