Sciweavers

1200 search results - page 40 / 240
» Marked Ancestor Problems
Sort
View
ACL
2012
12 years 9 days ago
Using Rejuvenation to Improve Particle Filtering for Bayesian Word Segmentation
We present a novel extension to a recently proposed incremental learning algorithm for the word segmentation problem originally introduced in Goldwater (2006). By adding rejuvenat...
Benjamin Börschinger, Mark Johnson
ICN
2005
Springer
14 years 3 months ago
AIMD Penalty Shaper to Enforce Assured Service for TCP Flows
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
Emmanuel Lochin, Pascal Anelli, Serge Fdida
JCSS
2007
89views more  JCSS 2007»
13 years 9 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
AAAI
1994
13 years 11 months ago
Lexical Acquisition in the Presence of Noise and Homonymy
This paper conjectures a computational account of how children might learn the meanings of words in their native language. First, a simplified version of the lexical acquisition t...
Jeffrey Mark Siskind
CDC
2009
IEEE
227views Control Systems» more  CDC 2009»
13 years 7 months ago
Reduced-order observer design using a Lagrangian method
This paper considers the problem of reduced-order observer design. A design procedure is proposed in which the impulse response of the observer is treated as the solution of a gene...
Mark Mutsaers, Siep Weiland, Richard Engelaar