461 search results - page 39 / 93 » Practical polynomial factoring in polynomial time |
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...