18306 search results - page 177 / 3662 » Algorithmics in Exponential Time |
79
Voted
AAIM
2007
Springer
15 years 4 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
IDA
2001
Springer
15 years 2 months ago
2001
Springer
This paper describes an unsupervised algorithm for segmenting categorical time series. The algorithm first collects statistics about the frequency and boundary entropy of ngrams, t...
79
Voted
IPL
2006
14 years 10 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
RANDOM
1999
Springer
15 years 2 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
113
Voted
STOC
1989
ACM
15 years 2 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...