12257 search results - page 455 / 2452 » Analysis of Algorithms |
138
Voted
IPL
2002
15 years 4 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
133
Voted
SIGCSE
2004
ACM
15 years 10 months ago
2004
ACM
Many algorithm visualizations have been created, but little is known about which features are most important to their success. We believe that pedagogically useful visualizations ...
146
Voted
JSAI
2001
Springer
15 years 9 months ago
2001
Springer
Basket Analysis is the most representative approach in recent study of data mining. However, it cannot be directly applied to the data including numeric data. In this paper, we cl...
143
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
140
click to vote
WAOA
2004
Springer
15 years 10 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...