4112 search results - page 34 / 823 » Efficient Algorithms for the Spoonerism Problem |
151
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...
130
click to vote
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...
127
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...
125
Voted
SIAMAM
2000
15 years 3 months ago
2000
An algorithm for a loaded crack partly in frictionless contact is presented. The problem is nonlinear in the sense that the equations of linear elasticity are supplemented by certa...
116
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...