Sciweavers

1154 search results - page 110 / 231
» On the editing distance of graphs
Sort
View
TASLP
2010
122views more  TASLP 2010»
13 years 4 months ago
Error Approximation and Minimum Phone Error Acoustic Model Estimation
Minimum phone error (MPE) acoustic parameter estimation involves calculation of edit distances (errors) between correct and incorrect hypotheses. In the context of large vocabulary...
Matt Gibson 0002, Thomas Hain
ACL
2012
12 years 15 days ago
Extracting Narrative Timelines as Temporal Dependency Structures
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
Oleksandr Kolomiyets, Steven Bethard, Marie-Franci...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
FOCS
2009
IEEE
14 years 4 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
OPODIS
2008
13 years 11 months ago
Graph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
Emmanuelle Lebhar, Nicolas Schabanel