5169 search results - page 18 / 1034 » Locality approximation using time |
KDD
2003
ACM
14 years 7 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
ENC
2005
IEEE
14 years 10 days ago
2005
IEEE
COMBINATORICS
2007
13 years 6 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
CPM
2009
Springer
14 years 1 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...