417 search results - page 26 / 84 » Running Time Predictions for Factoring Algorithms |
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
RECSYS
2010
ACM
14 years 12 months ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
CAV
2009
Springer
16 years 10 days ago
2009
Springer
Abstract. We study the problem of determining, given a run of a concurrent program, whether there is any alternate execution of it that violates atomicity, where atomicity is defin...
STOC
2005
ACM
16 years 2 days ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
NIPS
2008
15 years 1 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...