1813 search results - page 130 / 363 » Instance Pruning Techniques |
149
click to vote
AIPS
2004
15 years 7 months ago
2004
In this paper we analyze and extend a recently developed "task-swapping procedure" for improving schedules in oversubscribed situations. In such situations, there are ta...
183
click to vote
DMIN
2006
15 years 7 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
156
click to vote
ECIR
2003
Springer
15 years 7 months ago
2003
Springer
As more and more structured documents, such as SGML or XML documents become available on the Web, there is a growing demand to develop effective structured document retrieval which...
174
click to vote
UAI
2004
15 years 7 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
176
click to vote
ISCI
2008
15 years 6 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...