4114 search results - page 150 / 823 » Efficient Algorithms for the 2-Center Problems |
146
click to vote
IJCAI
1997
15 years 7 months ago
1997
Themost costly aspect of gathering information over the Internet is that of transferring data over the networkto answer the user’s query. Wemaketwo contributions in this paperth...
155
click to vote
EMO
2006
Springer
15 years 9 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...
174
click to vote
PAKDD
2010
ACM
15 years 8 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...
146
click to vote
CCCG
2008
15 years 7 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 ...
152
click to vote
CCCG
2008
15 years 7 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...