4110 search results - page 20 / 822 » Efficient algorithms for the 2-gathering problem |
158
Voted
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
230
click to vote
ISCA
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
149
Voted
ICAI
2004
15 years 5 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
129
Voted
FIMI
2004
15 years 5 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
124
click to vote
DAWAK
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...