613 search results - page 21 / 123 » Finding and Fixing Faults |
62
Voted
ECCC
2006
14 years 9 months ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
79
Voted
SODA
1990
ACM
14 years 10 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
SAC
2008
ACM
14 years 8 months ago
2008
ACM
Detecting errors in an early phase of software development can help to reduce the cost of software systems. Many research attempts presented a fixed set of rules to help finding e...
ACL
2010
14 years 7 months ago
2010
We present a novel system that helps nonexperts find sets of similar words. The user begins by specifying one or more seed words. The system then iteratively suggests a series of ...