Sciweavers

44651 search results - page 362 / 8931
» Generalized
Sort
View
136
Voted
EACL
2009
ACL Anthology
16 years 7 months ago
A General, Abstract Model of Incremental Dialogue Processing
David Schlangen, Gabriel Skantze
PODS
2009
ACM
170views Database» more  PODS 2009»
16 years 7 months ago
A general datalog-based framework for tractable query answering over ontologies
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...
Andrea Calì, Georg Gottlob, Thomas Lukasiew...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 7 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
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...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
16 years 7 months ago
All-pairs bottleneck paths for general graphs in truly sub-cubic time
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...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...