Sciweavers

3381 search results - page 202 / 677
» Extending Dependencies with Conditions
Sort
View
ACL
1996
15 years 7 months ago
An Efficient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
Mehryar Mohri, Richard Sproat
CORR
2008
Springer
81views Education» more  CORR 2008»
15 years 6 months ago
Universal Denoising of Discrete-time Continuous-Amplitude Signals
We consider the problem of reconstructing a discrete-time continuous-amplitude signal corrupted by a known memoryless channel with a general output alphabet. We develop a sequence ...
Kamakshi Sivaramakrishnan, Tsachy Weissman
AUTOMATICA
2006
135views more  AUTOMATICA 2006»
15 years 6 months ago
Finite-time convergent gradient flows with applications to network consensus
This paper introduces the normalized and signed gradient dynamical systems associated with a differentiable function. Extending recent results on nonsmooth stability analysis, we ...
Jorge Cortés
FUIN
2006
78views more  FUIN 2006»
15 years 6 months ago
Resource-Constrained Workflow Nets
We study concurrent processes modelled as workflow Petri nets extended with resource constraints. We define a behavioural correctness criterion called soundness: given a sufficient...
Kees M. van Hee, Natalia Sidorova, Marc Voorhoeve
NETWORKS
2008
15 years 6 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...