3192 search results - page 224 / 639 » The minimum latency problem |
137
click to vote
NAACL
2010
15 years 3 months ago
2010
We address a key problem in grapheme-tophoneme conversion: the ambiguity in mapping grapheme units to phonemes. Rather than using single letters and phonemes as units, we propose ...
144
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
151
click to vote
ICIP
2004
IEEE
16 years 7 months ago
2004
IEEE
Most existing ULP (unequal loss protection) schemes do not consider the minimum quality requirement and usually have high computation complexity. Previously, we proposed a layered...
147
click to vote
ICIP
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper presents a new approach to the tracking of regions in an image sequence. Unlike most other methods, the proposed approach can handle topology changes, i.e., regions may...
149
Voted
DAC
2006
ACM
16 years 6 months ago
2006
ACM
In this paper we present a new efficient algorithm for retiming sequential circuits with edge-triggered registers under both setup and hold constraints. Compared with the previous...