1814 search results - page 177 / 363 » Improved Results on Geometric Hitting Set Problems |
158
click to vote
COR
2006
15 years 6 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
288
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
143
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
163
click to vote
MCS
2009
Springer
16 years 1 months ago
2009
Springer
An ensemble is generated by training multiple component learners for a same task and then combining them for predictions. It is known that when lots of trained learners are availab...
174
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...