4112 search results - page 134 / 823 » Efficient Algorithms for the Spoonerism Problem |
152
click to vote
RSCTC
2000
Springer
15 years 8 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
135
click to vote
EMO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents a comprehensive comparison between the performance of state-of-the-art genetic algorithms NSGA-II, SPEA2 and IBEA and their differential evolution based variant...
150
click to vote
PAKDD
2010
ACM
15 years 6 months ago
2010
ACM
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
165
click to vote
MST
2002
15 years 4 months ago
2002
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
127
click to vote
CCCG
2008
15 years 5 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...