5244 search results - page 57 / 1049 » When are two algorithms the same |
AAIM
2007
Springer
14 years 1 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...
ACL
1994
13 years 9 months ago
1994
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular alg...
ICAPR
2005
Springer
14 years 1 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
NPC
2005
Springer
14 years 1 months ago
2005
Springer
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and con...
PARA
2004
Springer
14 years 1 months ago
2004
Springer
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one ...