6 search results - page 1 / 2 » A Note on the Expected Time for Finding Maxima by List Algor... |
135
Voted
ALGORITHMICA
1999
15 years 2 months ago
1999
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
120
Voted
IPL
2002
15 years 2 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...
135
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
142
Voted
TCS
2008
15 years 2 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
129
Voted
AI
2006
Springer
15 years 2 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...