44651 search results - page 372 / 8931 » A Generalization of the Least General Generalization |
172
Voted
EACL
2009
ACL Anthology
16 years 7 months ago
2009
ACL Anthology
281
Voted
PODS
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract) Andrea Cal`i2,1 , Georg Gottlob1,2 , and Thomas Lukasiewicz1, 1 Computing Laboratory, University of Oxford, UK firstname.lastname@comlab.ox.ac.uk 2 Oxford-Man Institute...
206
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
168
Voted
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
151
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...